Part of this work was done while the author was at the Laboratory for Foundations of Computer Science, University of Edinburgh.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Christensen. Decidability and Decomposition in Process Algebras. Ph.D. Thesis, University of Edinburgh, CST-105-93, (1993).
S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Proceedings of CONCUR '92, LNCS 630, pp. 138–147 (1992).
S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. CONCUR '93, LNCS 715, 143–157 (1993).
S. Eilenberg and M.P. Schützenberger. Rational sets in commutative monoids. Journal of Algebra 13, 173–191 (1969).
J. Esparza and M. Nielsen. Decidability Issues for Petri Nets—a Survey. EATCS Bulletin 52 (1994). Also: Journal of Information Processing and Cybernetics.
S. Ginsburg. The Mathematical Theory of Context-free Languages. McGraw-Hill (1966).
S. Ginsburg and E.H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics 16, pp. 285–296 (1966).
Y. Hirshfeld. Petri Nets and the Equivalence Problem. CSL '93, LNCS 832 pp. 165–174 (1994).
Y. Hirshfeld and Faron Moller. Deciding Equivalences in Simple Process Algebras. In: “Modal Logic and Process Algebra: Proceedings of a 3-day Workshop on Bisimulation”, CSLI Press (1995).
Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimulation of normed basic parallel processes. LFCS report 94-288, Edinburgh University (1994). To appear in Journal of Mathematical Structures in Computer Science.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
D.T. Huynh. Commutative Grammars: The Complexity of Uniform Word Problems. Information and Control 57, 21–39 (1983).
P. Jančar. Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems. STACS '94, LNCS 775, pp. 581–592 (1994). To appear in Theoretical Computer Science.
R. Milner. Communication and Concurrency. Prentice-Hall (1989).
P.H. Starke. Analyse von Petri-Netz Modellen. Teubner (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J. (1995). Petri nets, commutative context-free grammars, and basic parallel processes. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_54
Download citation
DOI: https://doi.org/10.1007/3-540-60249-6_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60249-1
Online ISBN: 978-3-540-44770-2
eBook Packages: Springer Book Archive