*For the most recent entries see the
Petri Nets Newsletter.*

## Reduction and Covering of Infinite Reachability Trees.

Finkel, Alain
In:
*Information and Computation, Vol. 89*, pages 144-179.
1990.

Abstract:
The author presents a structure for transtion systems with which the main
decidabibity results on Petri nets can be generalized to structured
transition systems. The reduced reachability tree is defined; it allows
one to decide the finite reachability tree problem and the finite
reachability set problem. A general definition of the coverability set is
given. It is shown that the coverability problem is a decidable problem in
the framework of well-structured transition systems. Finally, it is shown
that the finite reachability tree problem and the finite reachability set
problem are decidable.

Keywords:
reduction (and) covering (of) infinite reachability tree(s); structured
transition system; decidability (of the) coverability problem;
decidability (of the) reachability problem.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*