Elementary transition systems and refinement

Elementary transition systems are-in a strong categorical sense-the transition system version of a basic system model of net theory called elementary net systems. The structural notion of a region associated with elementary transition systems captures the intuitive idea of a local state as modelled by the conditions of an elementary net system. In this paper we equip elementary transition systems with a refinement operation over the local states (regions). We then show our operation satisfies a number of interesting properties. In particular, this operation supports compositional reasoning. It is very hard if not impossible to define a corresponding operation at the level of nets which enjoys similar properties. This is due to the concrete choice of conditions used to enforce intended behaviour. Thus our results show that the more abstract-but essentially equivalent-model of elementary transition systems is the appropriate framework for theoretical studies concerning refinement operations for elementary net systems.

[1]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[2]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[3]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[4]  Walter Vogler,et al.  Behaviour Preserving Refinement of Petri Nets , 1986, WG.

[5]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[6]  Astrid Kiehn,et al.  Petri Net systems and their closure properties , 1988, European Workshop on Applications and Theory in Petri Nets.

[7]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.