Petri nets, commutative context-free grammars, and basic parallel processes

Fundamenta Informaticae

Volumn 31, Issue 1, 1997, Pages 13-25

  Esparza, Javier ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Basic Parallel Processes; Commutative Context free Grammars; Petri nets; Weak bisimilarity

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; PARALLEL PROCESSING SYSTEMS;

COMMUTATIVE CONTEXT FREE GRAMMARS;

PETRI NETS;

EID: 0031185722     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-3112     Document Type: Article

References (16)

1. S. Christensen. Decidability and Decomposition in Process Algebras. Ph.D. Thesis, University of Edinburgh, CST-105-93, (1993).
2. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121(2), 143-148 (1995).
3. S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. CONCUR '93, LNCS 715, 143-157 (1993).
4. S. Eilenberg and M.P. Schützenberger. Rational sets in commutative monoids. Journal of Algebra 13, 173-191 (1969).
5. J. Esparza and M. Nielsen. Decidability Issues for Petri Nets - a Survey. EATCS Bulletin 52 (1994). Also: Journal of Information Processing and Cybernetics 30(3), 143-160 (1994).
6. J. Esparza and M. Nielsen. Decidability Issues for Petri Nets - a Survey. EATCS Bulletin 52 (1994). Also: Journal of Information Processing and Cybernetics 30(3), 143-160 (1994).
7. S. Ginsburg. The Mathematical Theory of Context-free Languages. McGraw-Hill (1966).
8. S. Ginsburg and E.H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics 16, 285-296 (1966).
9. Y. Hirshfeld. Petri Nets and the Equivalence Problem. CSL '93, LNCS 832, 165-174 (1994).
10. Y. Hirshfeld and Faron Moller. Decidability Results in Automata and Process theory. In "Logics for Concurrency", LNCS 1043, 102-148 (1996).
11. Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimularity of normed context-free processes. Theoretical Computer Science 158(1-2), 143-159 (1996).
12. Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimulation of normed basic parallel processes. Journal of Mathematical Structures in Computer Science, 6, 251-259 (1996).
13. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
14. D.T. Huynh. Commutative Grammars: The Complexity of Uniform Word Problems. Information and Control 57, 21-39 (1983).
15. P. Jančar. Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theoretical Computer Science 148, 281-301 (1995).
16. R. Milner. Communication and Concurrency. Prentice-Hall (1989).