For the most recent entries see the Petri Nets Newsletter.

Obtaining Deadlock-Preserving Skeletons for Coloured Nets.

Findlow, Greg

In: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 173-192. Springer-Verlag, June 1992.

Abstract: We extend Vautherin's work on behavioural relationships between coloured nets and their skeletons, which are ordinary Petri nets. A desirable property for a coloured net to have is that a marking is dead if and only if the corresponding skeletal marking is dead. This guarantees that for each deadlock (i.e. reachable dead marking) of the coloured net, the corresponding skeletal marking is a deadlock, so coloured deadlocks are `preserved' in the skeleton. Vautherin gave a rather restrictive sufficient condition for the aforementioned property. We formulate two necessary and sufficient conditions, thus identifying the class of coloured nets with `deadlock-preserving skeletons'. We then show how any coloured net may be detected via this skeleton. Moreover, the refolding transformation is optimal, in the sense that this skeleton is as small as possible.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography