Deciding monotonic games

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

Volumn 2803, Issue , 2003, Pages 1-14

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

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INFINITE STATE; SAFETY PROPERTY; TRANSITION RELATIONS; TRANSITION SYSTEM; WELL QUASI ORDERINGS; WINNING CONDITIONS;

ARTIFICIAL INTELLIGENCE;

EID: 21144444918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_1     Document Type: Article

References (19)

1. Parosh Aziz Abdulla, Karlis Čerāns, Bengt Jonsson, and Tsay Yih-Kuen. 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 Proc. ICALP '90, volume 443 of Lecture Notes in Computer Science, pages 322-335, 1990.
3. th Annual Symp. Foundations of Computer Science, pages 100-109, 1997.
4. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
5. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
6. Parosh Aziz Abdulla and Aletta Nylén. Timed Petri nets and BQOs. In Proc. ICATPN'2001: 22nd Int. Conf. on application and theory of Petri nets, volume 2075 of Lecture Notes in Computer Science, pages 53-70, 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, 1977.
8. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Symp. on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 323-333, 1999.
9. st International Colloquium on Automata, Lnaguages, and Programming, volume 820 of Lecture Notes in Computer Science, pages 35-46. Springer Verlag, 1994.
10. th IEEE Int. Symp. on Logic in Computer Science, 1998.
11. th Int. Conf. on Concurrency Theory, 2001.
12. th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 53-68. Springer Verlag, 2000.
13. G. Delzanno, J. Esparza, and A. Podelski. Constraint-based analysis of broadcast protocols. In Proc. CSL'99, 1999.
14. th IEEE Int. Symp. on Logic in Computer Science, 1999.
15. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3), 1994.
16. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere. Technical Report LSV-98-4, Ecole Normale Supérieure de Cachan, April 1998.
17. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326-336, 1952.
18. R. Mayr. Undecidable problems in unreliable computations. In Theoretical Informatics (LATIN'2000), number 1776 in Lecture Notes in Computer Science, 2000.
19. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 58-64, 2002.