Abstract
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric with respect to the initial and final marking. Sets of transition sequences described by finite automata are used for approximations to firing sequences, and the approximation error is assessed by Presburger expressions. The approximation algorithm is iterated until a sufficient criterion for reachability is satisfied. The exact computational complexity of the algorithm is an open problem.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 441-460 |
| Seitenumfang | 20 |
| Fachzeitschrift | SIAM Journal on Computing |
| Jahrgang | 13 |
| Ausgabenummer | 3 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 1984 |
| Extern publiziert | Ja |