Failure Semantics of Petri Nets and the Refinement of Places and Transitions.

For the most recent entries see the Petri Nets Newsletter.

Failure Semantics of Petri Nets and the Refinement of Places and Transitions.

1.--FMI: Interner Bericht TUM-INFO--01--90--I03--350. München: Technische Universiät, Mathematisches Institut und Institut für Informatik, 1990.

Abstract: The paper deals with equivalences of the type: N₁ is equivalent to N₂ if exchanging N₁ and N₂ in any context preserves behaviour. The behaviour considered on the one hand is being free of deadlocks, on the other hand being free of deadlocks and divergence. The author studies nets whose boundaries in a context consist of transitions only or, of places only. In both cases subclasses are defined where the equivalence is decidable. The results especially apply to the refinement of places and transitions.

Keywords: failure semantics; refinement (of places, transitions); deadlock freeness; divergence freeness; equivalence decidability.

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

Back to the Petri Nets Bibliography