Process rewrite systems

Electronic Notes in Theoretical Computer Science

Volumn 7, Issue , 1997, Pages 185-205

  Mayr, Richard ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; LOGIC PROGRAMMING; MATHEMATICAL MODELS; PETRI NETS; TURING MACHINES;

ABSTRACT MODELS; BISIMULATION EQUIVALENCE; PROCESS REWRITE SYSTEMS (PRS); REWRITE SYSTEMS;

CONCURRENT ENGINEERING;

EID: 0003353591     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80473-6     Document Type: Conference Paper

References (13)

1. A. Bouajjani and P. Habermehl. Constrained properties, semilinear systems, and Petri nets. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.
2. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.
3. Burkart O., Esparza J. More infinite results. Electronic Notes in Theoretical Computer Science (ENTCS). 5:1997
4. Caucal D. On the regular structure of prefix rewriting. Journal of Theoretical Computer Science. 106:1992;61-86
5. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993.
6. Esparza J. Decidability of model checking for infinite-state concurrent systems. Acta Informatica. 34:1997;85-107
7. Esparza J., Kiehn A. On the model checking problem for branching time logics and Basic Parallel Processes. CAV'95, volume 939 of LNCS. 1995;353-366 Springer Verlag
8. Kucera A. Regularity is decidable for normed PA processes in polynomial time. Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), volume 1180 of LNCS. 1996;Springer Verlag
9. Mayr E. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing. 13:1984;441-460
10. Mayr Richard. Combining Petri nets and PA-processes. International Symposium on Theoretical Aspects of Computer Software (TACS'97), LNCS. 1997;Springer Verlag. to appear
11. Richard Mayr. Model checking PA-processes. In International Conference on Concurrency Theory (CONCUR'97), volume 1243 of LNCS. Springer Verlag, 1997.
12. Mayr Richard. Tableau methods for PA-processes. Galmiche D. Analytic Tableaux and Related Methods (TABLE'AUX'97), volume 1227 of LNAI. 1997;Springer Verlag
13. Faron Moller. Infinite results. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.