For the most recent entries see the Petri Nets Newsletter.

Coverability Graphs for a Class of Synchronously Executed Unbounded Petri Nets.

Stotts, P. David

In: J. Parallel Distrib. Comput., Vol. 10, No. 3, pages 253-260. November 1990.

Abstract: Synchronous (or concurrent) transition firing rules for Petri nets are useful in modeling computations on real-time systems. A simple counterexample illustrates that the standard method of generating a Petri net coverability graph is insufficient to represent the reachability set of a Petri net operating under a synchronous firing rule. The author describes a variant of one widely used concurrent execution rule (that of firing maximal subsets) in which the simultaneous firing of conflicting transitions is prohibited. An algorithm is then given for constructing the coverability graph of a net executed under this synchronous firing rule; the algorithm terminates for conflict-free nets.

Keywords: coverability graph; unbounded net; synchronous, concurrent transition firing rule; reachability set; conflict-free net.


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

Back to the Petri Nets Bibliography