GenSys-LTL: Infinite State Reactive Synthesis using Logical LTL Games
Description
GenSys-LTL is an infinite-state reactive synthesis solver using LTL specifications. GenSys-LTL uses the Z3 theorem prover by Microsoft Research to solve and project SMT formulae. GenSys-LTL is scalable and is validated on standard benchmarks with compelling results.
This artifact is based on the recent ASE 2023 work: Symbolic Fixpoint Algorithms for Logical LTL Games.
The full version on arXiv with updated results from this artifact is found in: Towards Efficient Controller Synthesis Techniques for Logical LTL Games,
The details on reproducing the results using Docker or manually is found in README.md in the root folder of the artifact.
This GitHub branch also hosts the same code: https://github.com/stanlysamuel/gensys/tree/gensys-ltl
Files
gensys-ltl.zip
Files
(251.6 MB)
Name | Size | Download all |
---|---|---|
md5:faac3e82f5ad14a0b396bb1f94b73176
|
251.6 MB | Preview Download |
Additional details
Related works
- Is published in
- Conference paper: 10.1109/ASE56229.2023.00212 (DOI)
- Is version of
- Conference paper: 10.1145/3468264.3473126 (DOI)
- References
- Preprint: arXiv:2306.02427 (arXiv)