On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Optimizations for LTL Synthesis
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Compositional Control Synthesis for Partially Observable Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Improved algorithms for the automata-based approach to model-checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Church's problem and a tour through automata theory
Pillars of computer science
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Program sketching via CTL* model checking
Proceedings of the 18th international SPIN conference on Model checking software
A compositional framework for controller synthesis
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Small strategies for safety games
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
Formal Methods in System Design
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Code aware resource management
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper, we provide two compositional algorithms to solve safety games and apply them to provide compositional algorithms for the LTL synthesis problem. We have implemented those new compositional algorithms, and we demonstrate that they are able to handle full LTL specifications that are orders of magnitude larger than the specifications that can be treated by the current state of the art algorithms.