Realizable and unrealizable specifications of reactive systems, ICALP, 1989. ,
DOI : 10.1007/BFb0035748
Alternating refinement relations, In CONCUR, pp.163-178, 1998. ,
DOI : 10.1007/BFb0055622
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, CIAA, pp.57-67, 2008. ,
DOI : 10.1007/978-3-540-70844-5_7
Antichains: A New Algorithm for Checking Universality of Finite Automata, CAV, pp.17-30, 2006. ,
DOI : 10.1007/11817963_5
Improved algorithms for the automata-based approach to modelchecking, TACAS, pp.451-465, 2007. ,
Buechi complementation and size-change termination, 2009. ,
Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS, vol.2500, 2002. ,
DOI : 10.1007/3-540-36387-4
Optimizations for LTL Synthesis, 2006 Formal Methods in Computer Aided Design, pp.117-124, 2006. ,
DOI : 10.1109/FMCAD.2006.22
Safraless Decision Procedures, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005. ,
DOI : 10.1109/SFCS.2005.66
Borel Determinacy, Annals of Mathematics, pp.363-371, 1975. ,
DOI : 10.2307/1971035
From nondeterministic büchi and streett automata to deterministic parity automata, Logical Methods in Computer Science, vol.3, issue.3, 2007. ,
On the synthesis of a reactive module, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, 1989. ,
DOI : 10.1145/75277.75293
Algorithms for Omega-Regular Games with Imperfect Information, Logical Methods in Computer Science, vol.3, issue.3, 2007. ,
DOI : 10.2168/LMCS-3(3:4)2007
Modular synthesis of reactive systems, Weizmann Institute of Science, 1992. ,
Advanced spin tutorial, SPIN, volume 2989 of LNCS, pp.304-305, 2004. ,
Alternating finite automata on ??-words, Theoretical Computer Science, vol.32, issue.3, pp.321-330, 1984. ,
DOI : 10.1016/0304-3975(84)90049-5
On the complexity of omega -automata, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.319-327, 1988. ,
DOI : 10.1109/SFCS.1988.21948
Efficient büchi automata from LTL formulae, CAV, 2000. ,
Church???s Problem and a Tour through Automata Theory, Pillars of Computer Science, pp.635-655, 2008. ,
DOI : 10.1007/978-3-540-78127-1_35
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, TACAS, pp.63-77, 2008. ,
DOI : 10.1007/978-3-540-78800-3_6