Abstract
It is known [1] that Petri nets can model a system hierarchically, i. e., a transition or a place of a Petri net representing a system at an abstract level can be refined to model the system in more detail, and conversely, a portion of a Petri net may be replaced by a transition or by a place to give a more abstract description of the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Rerences
J.L. Peterson, “Petri nets”, Computing Surveys, Vol. 9, Mo. 3, pp. 223–252, September, 1977.
R. Valette, “Analysis of Petri nets by stepwise refinement”, J. Compt. System Sci., Vol. 18, No. 1, pp. 35–46, February, 1979.
H.J. Genrich and E. Stankiewicz-Wiechno, “A dictionary of some basic notions of net theory”, in W. Brauer (Ed.), Net Theory and Applications, Lecture Notes Series in Computer Science, Vol. 84, Springer-Verlag, 1980.
H.J. Genrich, K. Lautenbach and P.S. Thiagarajan, “Elements of general net theory”, pp. 21–164 in W. Brauer (Ed.), Net Theory and Applications, Lecture Notes Series in Computer Science, Vol. 84, Springer-Verlag, 1980.
C. André, P. Armand and F. Boeri, “Synchronic relations and applications in parallel computation”, Digital Processes, 5, 1979, pp. 99–113.
I. Suzuki and T. Murata, “A method for hierarchically representing large scale Petri nets”, Procs. of the 1980 IEEE International Conf. on Circuits and Computers, Vol. 2, pp. 620–623, October, 1980.
I. Suzuki and T. Murata, “A method for stepwise refinements and abstractions of Petri nets”, Comm. Lab. Report 80–3, Dept. of Information Engrg., University of Illinois, Chicago, June 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suzuki, I., Murata, T. (1982). Stepwise Refinements of Transitions and Places. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive