Abstract
Equivalence notions capture interesting behavioural properties of a system. Functional equivalences of Petri nets are state based equivalence notions that allow to compare systems with a different action level of detail. We introduce a functional equivalence on Petri nets suited for hierarchic modular system design and investigate correct transformation rules.
This work has been partially supported under grant C153/4 by the Deutsche Forschungsgemeinschaft.
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
Berthelot, G.: Transformations and decompositions of Nets; Brauer, W. et al (Eds): Advances in Petri Nets, LNCS 254, Springer 1987
Bernadinello,L.,De Cindio,F.: A Survey of BAsic Net Models and Modular Net Classes; Rozenberg, G.(Ed): Advances in Petri Nets 92, LNCS 609, Springer 1992, p.304–351
Brauer,W., Gold, R., Vogler,W.: A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets, Rozenberg, G.(Ed): Advances in Petri Nets 1990, LNCS 483, p.1–46
Chehaibar, G.: Replacement of Open Interface Subnets and Stable State Transformation Equivalence; Rozenberg, G.(Ed): Advances in Petri Nets 93, LNCS 674, Springer 1993, p.1–25
De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: A State-Transformation Equivalence for Concurrent Systems: Exhibited Functionality-Equivalence; Vogt, F.H.(Ed): Concurrency 1988, LNCS 335, Springer 1988, p.222–236
Goltz, U.; van Glabbeek,R.: Equivalence Notions for Concurrent Systems and the Refinement of Actions, GMD-Bericht 366, 1989
Goltz, U.; van Glabbeek,R.: Refinement of Actions in Causality Based Models; GMD-Bericht 428, 1990
Goltz, U.: On Representing CCS Programs by Finite Petri Nets; Chytil, M.P. et al (Eds): MFCS88, LNCS 324, Springer 1988, p.339–350
Milner, R.: Communication and Concurrency; Prentice Hall 1989
Pomello,L.,Simane,C.: A State Transformation Preorder over a class of EN systems; Rozenberg, G.(Ed): Advances in Petri Nets 90, LNCS 483, Springer 1991, p.436–456
Schreiber, G.: Functional equivalence of Petri nets; Dissertation (in German), Bericht 4¦94, Fachbereich Informatik, Universität Oldenburg
van Glabbeek, R.: Comparative Concurrency Semantics and the Refinement of Actions, Dissertation, CWI 1990
Suzuki, I.; Murata,T.: A Method for Stepwise Refinement and Abstraction of Petri Nets; J. of Computer and System Sciences 27,1983
Valette, R.: Analysis of Petri Nets by Stepwise Refinements; Journal of Computer and System Sciences 18,1979
Vogler, W.: Behaviour Preserving Refinements of Petri Nets; LNCS 246, Springer 1987
Vogler, W.: Failures Semantics based on Interval Semiwords is a Congruence for Refinement; Choffrut,C., Lengauer,T.(Eds): STACS 90, LNCS 415, Springer 1990, p.285–297
Voss, K.: Interface as a Basic Concept for Systems Specification and Verification; Voss, K. et al (Eds): Concurrency and Nets, Springer 1987, S.585–604
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schreiber, G. (1995). Functional equivalences of Petri nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_53
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive