1. 05 Oct, 2017 4 commits
  2. 03 Oct, 2017 3 commits
  3. 02 Oct, 2017 1 commit
  4. 29 Sep, 2017 12 commits
  5. 28 Sep, 2017 1 commit
  6. 27 Sep, 2017 2 commits
  7. 26 Sep, 2017 7 commits
  8. 25 Sep, 2017 10 commits
    • Maximilien Colange's avatar
      Fix a bug in scc_info, and clarify documentation · 2697fcdd
      Maximilien Colange authored
      * spot/twaalgos/sccinfo.hh, spot/twaalgos/sccinfo.cc: Implement it
      * tests/python/sccinfo.py: Test it
      * NEWS: Document the fix
      2697fcdd
    • Thibaud Michaud's avatar
      ltlsynt: translate winning strategy to AIGER · d6ae7af5
      Thibaud Michaud authored
      * bin/ltlsynt.cc: Here.
      * doc/org/ltlsynt.org: Document it.
      * tests/core/ltlsynt.test: Test it.
      d6ae7af5
    • Thibaud Michaud's avatar
      parity game: compute winning strategy · 601e1405
      Thibaud Michaud authored
      * spot/misc/game.cc, spot/misc/game.hh: Here.
      * bin/ltlsynt.cc: Realizability is now done by checking if the winning
      strategy contains the initial state.
      601e1405
    • Thibaud Michaud's avatar
      parity game: add Zielonka's recursive algorithm · f414e9f5
      Thibaud Michaud authored
      * spot/misc/game.cc, spot/misc/game.hh: Implement it.
      * bin/ltlsynt.cc: Use it.
      * doc/org/ltlsynt.org: Document it.
      f414e9f5
    • Thibaud Michaud's avatar
      add ltlsynt executable · 0821c97e
      Thibaud Michaud authored
      For now, ltlsynt only handles LTL realizability. It uses a reduction to
      parity game followed by Calude et al.'s reduction from parity game to
      reachability game.
      
      * bin/ltlsynt.cc, bin/Makefile.am, bin/man/ltlsynt.x,
      bin/man/Makefile.am, bin/.gitignore: New binary.
      * doc/org/arch.tex, doc/Makefile.am, doc/org/tools.org,
      doc/org/ltlsynt.org: Document it.
      * spot/misc/game.cc, spot/misc/game.hh, spot/misc/Makefile.am: Parity
      game wrapper for parity automata + reachability game interface from
      Calude et al.'s paper.
      0821c97e
    • Laurent XU's avatar
      parity: add spot::parity_product_or() · 7a118426
      Laurent XU authored
      parity_product_or constructs the sum of two parity automata and it keeps
      the parity.
      
      * spot/twaalgos/parity.cc, spot/twaalgos/parity.hh: Here.
      * tests/core/parity.cc: Add tests here.
      7a118426
    • Laurent XU's avatar
      parity: merge states having same cleaned matrices in parity_product · 192fb6c1
      Laurent XU authored
      Some states can become identical once their history matrix are
      cleaned. These states are merged and only store the cleaned matrix.
      
      * spot/twaalgos/parity.cc: Here.
      192fb6c1
    • Laurent XU's avatar
      parity: remove history matrices in parity_product() · cb7e43cb
      Laurent XU authored
      The history matrix of size n*m is replaced by couples of vectors with a
      total size of n + m. These couples of vectors are simplified
      representations of the history matrices, they ecnode the exact same
      data. They are cached as well as the method to get the next history
      matrix using the acc_sets and the current history matrix.
      
      * spot/twaalgos/parity.cc: Here.
      cb7e43cb
    • Laurent XU's avatar
      parity: add spot::parity_product() · b92320cc
      Laurent XU authored
      Compute the synchronized product of two parity automata, this product
      keeps the parity acceptance.
      
      * spot/twaalgos/parity.cc, spot/twaalgos/parity.hh: Here
      * tests/core/parity.cc: Add tests for spot::parity_product()
      b92320cc
    • Laurent XU's avatar
      parity: add spot::cleanup_parity_acceptance() · 3e650f18
      Laurent XU authored
      Merge the acceptance sets of a parity acceptance with the same priority
      level to simplify this acceptance.
      
      * spot/twaalgos/parity.cc, spot/twaalgos/parity.hh: Here
      * tests/core/parity.cc: Add tests for spot::cleanup_parity_acceptance()
      3e650f18