Monotonic and downward closed games

Journal of Logic and Computation

Volumn 18, Issue 1, 2008, Pages 153-169

  Abdulla, Parosh Aziz ^a   Bouajjani, Ahmed ^b   D'Orso, Julien ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Infinite state games; Lossy channel systems; Petri nets; Vector Addition Systems

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INFORMATION THEORY; PETRI NETS;

INFINITE-STATE GAMES; LOSSY CHANNEL SYSTEMS; VECTOR ADDITION SYSTEMS;

GAME THEORY;

EID: 38749124024     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exm062     Document Type: Article

References (22)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160, 109-127, 2000.
2. R. Alur and D. Dill. Automata for modelling real-time systems. In Proceedings of ICALP '90. Vol. 443 of Lecture Notes in Computer Science, pp. 322-335. Springer, Warwick, 1990.
3. R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of 38th Annual Symposium on Foundations of Computer Science, pp. 100-109. IEEE Computer Society, Miami Beach, Florida, 1997.
4. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130, 71-90, 1996.
5. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127, 91-101, 1996.
6. P. A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In Proc. ICATPN'2001: 22nd International Conference on Application and Theory of Petri nets. Vol. 2075 of Lecture Notes in Computer Science, pp. 53-70. Springer, Newcastle, UK, 2001.
7. J. M. Barzdin, J. J. Bicevskis, and A. A. Kalninsh. Automatic construction of complete sample systems for program testing. In IFIP Congress, 1977, Toronto, North-Holland, 1977.
8. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Symposium on Theoretical Aspects of Computer Science. Vol. 1563 of Lecture Notes in Computer Science, pp. 323-333. Springer, Trier, Germany, 1999.
9. K. Čerāns. Deciding properties of integral relational automata. In Proc. ICALP '94, 21st International Colloquium on Automata, Languages, and Programming, Serge Abiteboul and Eli Shamir, eds. Vol. 820 of Lecture Notes in Computer Science, pp. 35-46. Springer Verlag, Jerusalem, 1994.
10. L. de Alfaro, T. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. CONCUR 2001, 12th International Conference on Concurrency Theory. K. G. Larsen and M. Nielsen, eds. Vol. 2154 of Lecture Notes in Computer Science, pp. 536-550. Springer Verlag, Aaalborg, 2001.
11. G. Delzanno. Automatic verification of cache coherence protocols. In Proceedings 12th International Conference on Computer Aided Verification, E. Allen Emerson and A. Prasad Sistla, eds. Vol. 1855 of Lecture Notes in Computer Science, pp. 53-68. Springer Verlag, Chicago, 2000.
12. G. Delzanno, J. Esparza, and A. Podelski. Constraint-based analysis of broadcast protocols. In Proc. CSL'99. Springer, Madrid, 1999.
13. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. LICS '99, 14th IEEE International Symposium on Logic in Computer Science, IEEE Computer Society, Trento, Italy, 1999.
14. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7, 129-135, 1994.
15. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256, 63-92, 2001.
16. E. Grädel, W. Thomas, and T. Wilke. Automata, Logics, and Infinite Games: A Guide to Current Research. Vol. 2500 of Lecture Notes in Computer Science, Springer, Dagstuhl, Germany, 2002.
17. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of London Mathematical Society, 2, 326-336, 1952.
18. P. Jančar. Undecidability of bisimilarity for Petri nets and related problem. Theoretical Computer Science, 148, 281-301, 1995.
19. R. Mayr. Undecidable problems in unreliable computations. In Theoretical Informatics (LATIN'2000). Number 1776 in Lecture Notes in Computer Science, Springer, Punta del Este, Uruguay, 2000.
20. J.-F. Raskin, M. Samuelides, and L. Van Begin. Games for counting abstractions. Electronic Notes in Theoretical Computer Science, 128, 69-85, 2005.
21. W. Thomas. Infinite games and verification. In Proceedings of 14th International Conference on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pp. 58-64. Springer, Copenhagen, Denmark, 2002.
22. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200, 135-183, 1998.