Abstract
The aim of this paper is to provide a hierarchical design method, refinement by replacing place-bordered subnets, with a hierarchical analysis method based on equivalence and preorder. We consider nets with distinguised places (interface places) and distinguished states (stable states), called open interface nets (OI-nets); OI-systems are OI-nets such that the stable state set is a home space. Two equivalence notions are defined: ≡SF on OI-systems and ≡SST on OI-nets. We show that if N 1 ≡SST N 2 and N 2 is robust (robust OI-nets are a subclass of OI-nets) then N [N 1 ← N2] ≡sf N. Since an equivalence is too restrictive in hierarchical design and it is only possible to replace subnets of N whose border is a subset of the interface of N, an interface expansion operation is defined giving rise to a preorder \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \prec } _{SF}\) such that \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \prec } _{SF} \cap \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \prec } _{SF}^{ - 1} = \equiv _{SF}\).
This work is part of BULL's contribution to DEMON (ESPRIT BRA 3148)
Preview
Unable to display preview. Download preview PDF.
References
C. André, Use of the Behavior Equivalence in Place-Transition Net Analysis. Applications and Theory of Petri Nets, IF 52, Springer Verlag, 1982, pp 241–250.
B. Baumgarten. On Internal and External Characterizations of PT-nets Building Block Behavior. Advances in Petri Nets 88, LNCS 340, pp 44–61.
A. Bourguet-Rouget. External Behavior Equivalence between two Petri Nets. Concurrency 88, LNCS 335, pp 237–256
G. Chehaibar. Use of Reentrant Nets in Modular Analysis of Colored, Nets. Advances in Petri Nets 1991, LNCS, to appear.
F. De Cindio, G. De Michelis, L. Pomello, C. Simone. A State Transformation Equivalence for Concurrent Systems: Exibited Functionality Equivalence. Concurrency 88, LNCS 335, pp 222–236.
F. De Cindio, G. De Michelis, C. Simone. GAMERU: A Language for the Analysis and Design of Human Communication Pragmatics within Organizational Systems. Advances in Petri Nets 87, LNCS 266, pp 21–44.
R. Di Giovanni. Petri Nets and Software Engineering: HOOD Nets. Eleventh International Conference on Application and Theory of Petri Nets, Paris, June 1990.
C. Girault. Petri Net Methods for Design and Analysis of Distributed Systems. Invited Talk, Eleventh International Conference on Application and Theory of Petri Nets, Paris, June 1990.
R. van Glabbeek, U. Goltz. Equivalence Notions for Concurrent Systems and Refinement of Actions. MFCS 89, LNCS 379, pp 237–248.
G. Memmi and J. Vautherin. Analysing Nets by the Invariant Method. Petri Nets: Central Models and their Properties, LNCS 254, Springer Verlag, 1986, pp 300–337
L. Pomello. Some Equivalence Notions for Concurrent Systems: An Overview. Advances in Petri Nets 85, LNCS 222, pp 381–400
L. Pomello, C. Simone. A State Transformation Preorder over a Class of ENSystems. Tenth International Conference on Application and Theory of Petri nets, Bonn, June 1989.
L. Pomello. Refinement of Concurrent Systems Based on Local State Transformations. Stepwise Refinement of Distributed Systems, LNCS 430, pp 641–668.
I. Suzuki, T. Murata. A Method for Stepwise Refinement and Abstraction of Petri Nets. JCSS 27, 1983, pp 51–76.
R. Valette. Analysis of Petri Nets by Stepwise Refinements. JCSS 18, 1979, pp 35–46.
A. Valmari. Compositional State Space Generation. Eleventh International Conference on Application and Theory of Petri Nets, Paris, June 1990.
W. Vogler. Behavior Preserving Refinements of Petri Nets. Graph-Theoretic Concepts in Computer Science 86, LNCS 246, pp 82–93.
W. Vogler. Failures Semantics and Deadlocking of Modular Petri Nets. Acta Informatica 26, pp 333–348, 1989.
W. Vogler. Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. Distributed Computing 4, pp 139–162, 1991.
W. Vogler. Failures Semantics of Petri Nets and the Refinement of Places and Transitions. TUM 350, Janvier 1990.
W. Vogler. Asynchronous Communication of Petri Nets and the Refinement of Transitions. TUM 342/7/91 A, 1991.
K. Voss. Interface as a Basic Concept for System Specification and Verification. Concurrency and Nets, Springer Verlag 1987, pp 585–604.
G. Winskel. Petri Nets, Morphisms and Compositionality. Advances in Petri Nets 85, LNCS 222, pp 453–477.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chehaibar, G. (1993). Replacement of open interface subnets and stable state transformation equivalence. In: Rozenberg, G. (eds) Advances in Petri Nets 1993. ICATPN 1991. Lecture Notes in Computer Science, vol 674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56689-9_37
Download citation
DOI: https://doi.org/10.1007/3-540-56689-9_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56689-2
Online ISBN: 978-3-540-47631-3
eBook Packages: Springer Book Archive