On Internal and External Characterizations of PT- net Building Block Behaviors

Subnets whose relative boundary consists only of transitions, termed building blocks, are used to structure specifications of distributed systems. In this paper we consider the problem how to determine the effects of a building block on its possible environments, considering only its internal structure. External equivalence of building blocks allows one to change these components without affecting the behaviour of the environment and is thus of practical importance. As there are infinitely many potential environments, external equivalence cannot be expressed in a finite form (nor proven) easily. We investigate contexts in which internal equivalence, which is often obtainable without too much effort, is a sufficient condition for external equivalence. The approach chosen here is to specify the building blocks internally by a set of net languages, and to define internal equivalence as the equality of these specifications.

[1]  Karl Martin Schmidt-Reindl,et al.  Notations and terminology on Petri Net theory , 1987 .

[2]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[3]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[4]  Klaus Voss,et al.  On the Notion of Interface in Condition/Event-Systems , 1982, European Workshop on Applications and Theory of Petri Nets.

[5]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[6]  Charles André Use of the Behaviour Equivalence in Place-Transition Net Analysis , 1981, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[7]  Heinz Jürgen Burkhardt,et al.  Modelling of OSI-Communication Services and Protocols Using Predicate/Transition Nets , 1984, PSTV.

[8]  Bernd Baumgarten,et al.  The signing of a contract - a tree-structured application , 1985, Applications and Theory in Petri Nets.

[9]  Rainer Prinoth,et al.  An Algorithm to Construct Distributed Systems from State-Machines , 1982, Protocol Specification, Testing and Verification.

[10]  Manfred Broy,et al.  Semantics of Communicating Processes , 1984, Inf. Control..

[11]  Rüdiger Valk,et al.  Infinite behaviour and fairness in Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[12]  Bernd Baumgarten,et al.  Building blocks for distributed system design , 1985, PSTV.

[13]  Rüdiger Valk,et al.  Infinite Behaviour and Fairness , 1986 .

[14]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.