Process rewrite systems

Information and Computation

Volumn 156, Issue 1-2, 2000, Pages 264-286

  Mayr, Richard ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LOGIC; MATHEMATICAL MODELS; PETRI NETS;

REWRITE SYSTEMS;

EQUIVALENCE CLASSES;

EID: 0034627955     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2826     Document Type: Article

References (24)

1. Burkart, O., Caucal, D., and Steffen, B. (1996), Bisimulation collapse and the process taxonomy, in "Proceedings of CONCUR'96" (U. Montanari and V. Sassone, Eds.), Lect. Notes in Comput. Sci., Vol. 1119, Springer-Verlag, Berlin.
2. Burkart, O., and Esparza, J. (1997), More infinite results, Electron. Notes Theoret. Comput. Sci. (ENTCS), Vol. 5.
3. Bouajjani, A., Esparza, J., and Maler, O. (1997), Reachability analysis of pushdown automata: Application to model checking, in "International Conference on Concurrency Theory (CONCUR'97)," Lect. Notes in Comput. Sci., Vol. 1243, Springer-Verlag, Berlin.
4. Bouajjani, A., and Habermehl, P. (1996), Constrained properties, semilinear systems, and Petri nets, in "Proceedings of CONCUR'96" (U. Montanari and V. Sassone, Eds.), Lect. Notes in Comput. Sci., Vol. 1119, Springer-Verlag, Berlin.
5. Bergstra, J. A., and Klop, J. W. (1985), Algebra of communicating processes with abstraction, Theoret. Comput. Sci. (TCS) 37, 77-121.
6. Caucal, D. (1992), On the regular structure of prefix rewriting, J. Theoret. Comput. Sci. 106, 61-86.
7. Cousot, P., and Halbwachs, N. (1978), Automatic discovery of linear restraints among variables of a program, in "5th ACM Symposium on Principles of Programming Languages," ACM Press, New York.
8. Christensen, S. (1993), "Decidability and Decomposition in Process Algebras," Ph.D. thesis, Edinburgh University.
9. Dickson, L. E. (1913), Finiteness of the odd perfect and primitive abundant numbers with distinct factors, Am. J. Math. 35, 413-422.
10. Esparza, J., and Kiehn, A. (1995), On the model checking problem for branching time logics and Basic Parallel Processes, in "CAV'95," Lect. Notes in Comput. Sci., Vol. 939, pp. 353-366, Springer-Verlag, Berlin.
11. Esparza, J. (1997), Decidability of model checking for infinite-state concurrent systems, Acta Inform. 34, 85-107.
12. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
13. Jančar, P. (1990), Decidability of a temporal logic problem for Petri nets, Theoret. Comp. Sci. 74, 71-93.
14. Kučera, A. (1996), Regularity is decidable for normed PA processes in polynomial time, in "Foundations of Software Technology and Theoretical Computer Science (FST&TCS'96)," Lect. Notes in Comput. Sci., Vol. 1180, Springer-Verlag, Berlin.
15. Lipton, R. (1976), "The Reachability Problem Requires Exponential Space," Technical Report 62, Department of Computer Science, Yale University.
16. Mayr, E. (1984), An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13, 441-460.
17. Mayr, R. (1997), Combining Petri nets and PA-processes, in "International Symposium on Theoretical Aspects of Computer Software (TACS'97)" (M. Abadi and T. Ito, Eds.), Lect. Notes in Comput. Sci., Vol. 1281, Springer-Verlag, Berlin.
18. Mayr, R. (1997), Model checking PA-processes, in "International Conference on Concurrency Theory (CONCUR'97)," Lect. Notes in Comput. Sci., Vol. 1243, Springer-Verlag, Berlin.
19. Mayr, R. (1997), Process rewrite systems, Vol. 7, "Proceedings of Expressiveness in Concurrency (EXPRESS'97)," Electronic Notes in Theoretical Computer Science (ENTCS).
20. Mayr, R. (1998), "Decidability and Complexity of Model Checking Problems for Infinite-State Systems," Ph.D. thesis, TU-München.
21. Melzer, S., and Esparza, J. (1996), Checking system properties via integer programming, in "Proc. of ESOP'96" (H. R. Nielson, Ed.), Lecture Notes in Computer Science, Vol. 1058, pp. 250-264, Springer-Verlag, Berlin.
22. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
23. Moller, F. (1996), Infinite results, in "Proceedings of CONCUR'96" (U. Montanari and V. Sassone, Eds.), Lect. Notes in Comput. Sci., Vol. 1119, Springer-Verlag, Berlin.
24. Murata, T. (1989), Petri nets: Properties, analysis and applications, Proc. IEEE 77(4), 541-580.