Abstract
High-level Petri nets are frequently represented as Petri net schemas, with places, transitions and arcs inscribed by terms. A concrete system is then gained by interpreting the symbols in those terms. The behavior of a concrete system is a transition system. The composition of all those transition systems represents the behavior of the Petri net schema.
This paper characterizes the expressive power of (a basic class of) Petri net schemas. It turns out that quite simple as well as quite general requirements at a transition system suffice to generate it by such a Petri net schema.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gurevich, Y.: A new thesis. American Mathematical Society Abstracts 6(4), 317 (1985)
Gurevich, Y.: Sequential Abstract-State Machines Capture Sequential Algorithms. ACMTCL 1(1), 77–111 (2000)
Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary Transition Systems. Theoretical Computer Science 96, 3–333 (1992)
Reisig, W.: Distributed Algorithms. Springer, Heidelberg (1997)
Reisig, W.: On Gurevich’s theorem on sequential algorithms. Acta Informatica 39(5), 273–305 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reisig, W. (2005). On the Expressive Power of Petri Net Schemata. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_20
Download citation
DOI: https://doi.org/10.1007/11494744_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)