An antichain algorithm for LTL realizability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 263-277

  Filiot, Emmanuel ^a   Jin, Naiyong ^a   Raskin, Jean François ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ANTICHAIN; INCREMENTAL ALGORITHM; REALIZABILITY; SYNTHESIS PROBLEMS; WORD AUTOMATA;

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; TRANSLATION (LANGUAGES);

GAME THEORY;

EID: 70350243077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_22     Document Type: Conference Paper

References (21)

1. Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ausiello, G., Dezani-Ciancaglini, M., Ronchi Della Rocca, S. (eds.) ICALP 1989. LNCS, vol. 372, pp. 1-17. Springer, Heidelberg (1989)
2. Acacia (2009), http://www.antichains.be
3. Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163-178. Springer, Heidelberg (1998)
4. Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-based universality and inclusion testing over nondeterministic finite tree automata. In: CIAA, pp. 57-67 (2008)
5. De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg (2006)
6. Doyen, L., Raskin, J.-F.: Improved algorithms for the automata-based approach to model-checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 451-465. Springer, Heidelberg (2007)
7. Fogarty, S., Vardi, M.: Buechi complementation and size-change termination. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 16-30. Springer, Heidelberg (2009)
8. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
9. Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: FMCAD, pp. 117-124. IEEE Computer Society, Los Alamitos (2006)
10. Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (2005)
11. Martin, D.: Borel determinacy. Annals of Mathematics 102, 363-371 (1975)
12. Piterman, N.: From nondeterministic büchi and streett automata to deterministic parity automata. Logical Methods in Computer Science 3(3) (2007)
13. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: ACM Symposium on Principles of Programming Languages (POPL). ACM, New York (1989)
14. Raskin, J.-F., Chatterjee, K., Doyen, L., Henzinger, T.A.: Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science 3(3) (2007)
15. Rosner, R.: Modular synthesis of reactive systems. Ph.d. dissertation, Weizmann Institute of Science (1992)
16. Ruys, T.C., Holzmann, G.J.: Advanced SPIN Tutorial. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 304-305. Springer, Heidelberg (2004)
17. Miyano, S., Hayashi, T.: Alternating automata on Ω-words. Theoretical Computer Science 32, 321-330 (1984)
18. Safra, S.: On the complexity of Ω automata. In: FOCS, pp. 319-327 (1988)
19. Somenzi, F., Bloem, R.: Efficient büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
20. Thomas, W.: Church's problem and a tour through automata theory. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 635-655. Springer, Heidelberg (2008)
21. De Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: Alternative algorithms for LTL satisfiability and model-checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 63-77. Springer, Heidelberg (2008)