Report LRI--523. Univ. de Paris-Sud, Centre d'Orsay, Laboratoire de Recherche en Informatique, October 1989.
Abstract: The author presents a structure for transition systems with which the main decidability results on Petri nets can be generalized to structured transition systems. The author defines the reduced reachability tree of a structured transition system; it allows to decide the finite reachability tree problem and the finite reachability set problem. A general definition of the coverability set is given and it is shown that the coverability problem is a decidable problem in the framework of well-structured transition systems.
Keywords: infinite reachability tree; structured transition system; reduced reachability tree; decidability (of) finite reachability tree problem, finite reachability set problem; well-structured transition system.
Back to the Petri Nets Bibliography