Abstract
Since Petri-net-descriptions of processes tend to be impracticably large, there is a need for a condensation mechanism. This paper attacks this problem by at first describing a purely structural condensation operation as a tool for stepwise condensation and refinement. Then, a consistent semantic interpretation is given, which allows to transform marking properties dynamically.
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
Literature
Jürgen Ebert An analogy between nets and hypergraphs Newsletter No. 4, Feb. 1980, Gesellschaft für Informatik, SIG "Petri Nets and Related System Models", 7–10
Jürgen Ebert Erreichbarkeits-konsistente Vergröberungen von Netzen Osnabrücker Schriften zur Mathematik, Reihe M, 1980
Jürgen Perl Reachability-homomorphisms on graphs in U. Pape, "Discrete Structures and Algorithms", Hanser Verlag, München-Wien, 1980, 101–112
Jürgen Perl übertragung des Markierungsbegriffs auf vergröberte Petrinetze Osnabrücker Schriften zur Mathematik, Reihe M, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ebert, J., Perl, J. (1981). Reachability homomorphisms on nets. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive