Observing partial order runs of Petri Nets
A reformulation of the standard causal semantics for Petri nets is proposed which allows one to reconstruct a partial order run from sequential observations without any knowledge of the underlying net structure or its current marking. It provides a new solution to how Mazurkiewicz's trace theory can be generalized to unbounded nets.
Unable to display preview. Download preview PDF.
- [DD89]P. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP 89, number 372 in Lecture Notes in Computer Science, pages 234–248, 1989.Google Scholar
- [Die90]V. Diekert. Combinatorics of Traces. number 454 in Ledure Notes in Computer Science, 1990.Google Scholar
- [HKT92]P. W. Hoogers, H. C. M. Kleijn, and P. S. Thiagarajan. A trace semantics for Petri nets. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 595–604, 1992.Google Scholar
- [Maz77]A. Mazurkiewicz. Concurrent program schemes and their interpretation. Report DAIMI PB-78, Aarhus University, 1977.Google Scholar