Deciding true concurrency equivalences on safe, finite nets
We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for expspace. We also show that history-preserving bisimulation between such nets is complete for dexptime. Our methods also yield tight complexity bounds for several other “true conc...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 1996-01, Vol.154 (1), p.107-143 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for
expspace. We also show that history-preserving bisimulation between such nets is complete for
dexptime. Our methods also yield tight complexity bounds for several other “true concurrency” and interleaving equivalences. The results are independent of the presence of hidden transitions. |
|---|---|
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/0304-3975(95)00132-8 |