On condition/event representations of place/transition systems. (English) Zbl 0634.68059

Concurrency and nets. Advances in Petri nets, 217-231 (1987).
[For the entire collection see Zbl 0624.00017.]
The paper deals with the problem of representing a place/transition system by conditions (carrying at most one token) and events. One idea is to associate with each place a number of conditions and with each transition several events, one for each possible choice of token distribution. This construction is formalized and investigated using the notion of (step) bisimulation equivalence. A method is given to construct a C/E representation for a given P/T-system. Subsequently the P/T and C/E representations are shown to be equivalent. A discussion reveals fundamental issues, as conflicts and contacts, which are hidden in the P/T-system but arise in the C/E-system.
Reviewer: D.Cristea


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)


Zbl 0624.00017