Partially supported by NSF grant CCR-8901693
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
M. Hack. The equality problem for vector addition systems is undecidable. Theoretical Computer Science, 2:77–95, 1976.
R.R. Howell, L.E. Rosier, and H. C. Yen. An O(n 1.5) algorithm to decide boundedness for conflict free vector replacement systems. Technical report, University of Texas at Austin, 1986.
D.T. Huynh. Commutative grammars: the complexity of the uniform word problems. Information and Control, 57:21–39, 1983.
M. Jantzen. Complexity of place and transition systems. In Petri Nets: Central Models and their Properties, volume 254 of LNCS. Springer-Verlag, 1986.
M. Jantzen. Language theory of Petri nets. In Petri Nets: Central Models and their Properties, volume 254 of LNCS. Springer-Verlag, 1986.
W. Reisig. Petri Nets, volume 4 of EATCS. Springer Verlag, 1986.
G. Rozenberg and R. Verraedt. Subset languages of Petri nets part I: The relationship to string languages and normal forms. Theoretical Computer Science, 26:301–326, 1983.
G. Rozenberg and R. Verraedt. Subset langauges of Petri nets part II: The closure properties. Theoretical Computer Science, 27:85–108, 1983.
R. Valk and G. Vidal-Naquet. Petri nets and regular languages. Journal of Computers and System Science, 23:299–325, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bloom, S.L., Sutner, K. (1989). Shuffle equations, parallel transition systems and equational Petri nets. In: DÃaz, J., Orejas, F. (eds) TAPSOFT '89. CAAP 1989. Lecture Notes in Computer Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50939-9_129
Download citation
DOI: https://doi.org/10.1007/3-540-50939-9_129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50939-4
Online ISBN: 978-3-540-46116-6
eBook Packages: Springer Book Archive