Model checking PA-processes

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

Volumn 1243, Issue , 1997, Pages 332-346

  Mayr, Richard ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Model checking; PA processes; Process algebras; Tableau systems

Indexed keywords

EID: 0000926680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_23     Document Type: Conference Paper

References (8)

1. A. Bouajjani and P. Habermehl. Constrained properties, semilineax systems, and petri nets. In Ugo Montanaxi and Vladimiro Sassone, editors, Proceedings of CONCUR'P6, number 1119 in LNCS. Springer Verlag, 1996.
2. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993.
3. J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In CAV'95, number 939 in LNCS, pages 353-366. Springer Verlag, 1995.
4. J. Esparza. Decidability of model checking for infinite-state concurrent systems. To appear in Acta Informatica.
5. J. Esparza. More infinite results. In B. Steffen and T. Margaxia, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996.
6. Richard Mayr. Some results on basic parallel processes. Technical Report TUM-I9616, TU-Mfinchen, March 1996.
7. Richard Mayr. Weak bisimulation and model checking for basic parallel processes. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), number 1180 in LNCS. Springer Verlag, 1996.
8. R. Milner. Communication and Concurrency. Prentice Hall, 1989.