Combining petri nets and PA-processes

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

Volumn 1281, Issue , 1997, Pages 547-561

  Mayr, Richard ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

PA processes; Petri nets; Process algebra; Reachability problem

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER SOFTWARE;

INFINITE STATE CONCURRENT SYSTEMS; PROCESS ALGEBRAS; REACHABILITY PROBLEM;

PETRI NETS;

EID: 0003300181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014567     Document Type: Conference Paper

References (12)

1. [BEH95] A. Bouajjani, R. Echahed, and P. Habermehl. Verifying infinite state processes with sequential and parallel composition. In Proceedings of POPL'95, pages 95-106. ACM Press, 1995.
2. [BH96] A. Bouajjani and P. Habermehl. Constrained properties, semilinear systems, and petri nets. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, number 1119 in LNCS. Springer Verlag, 1996.
3. [BS94] O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, number 836 in LNCS, pages 98-113. Springer Verlag, 1994.
4. [Chr93] S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993.
5. [EK95] 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.
6. [Esp96] J. Esparza. More infinite results. In B. Steffen and T. Margaria, editors, Proceedings of INPINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996.
7. [Esp97] J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
8. [Kuc96] A. Kucera. Regularity is decidable for normed pa processes in polynomial time. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), number 1180 in LNCS. Springer Verlag, 1996.
9. [May84] E. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 13:441-460, 1984.
10. [May96a] Richard Mayr. Model checking pa-processes. Technical Report TUM-I9640, TU-Miinchen, December 1996. To appear in CONCUR'97.
11. [May96b] 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.
12. [May97] Richard Mayr. Tableau methods for pa-processes. In Analytic Tableaux and Related Methods (TABLEAUX'97), LNAI. Springer Verlag, 1997. to appear.