Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Free choice Petri nets
Properties of Conflict-Free and Persistent Petri Nets
Journal of the ACM (JACM)
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Seminar on Concurrency, Carnegie-Mellon University
Partial orders and the axiomatic theory of shuffle (pomsets)
Partial orders and the axiomatic theory of shuffle (pomsets)
Arbitration-free synchronization
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of Computer and System Sciences
Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Separability in conflict-free petri nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Hi-index | 0.00 |
This paper discusses the following results: that bounded Petri nets can be transformed into pomset-equivalent safe nets; that boundedmarked graphs can be transformed into step-language-equivalent safe marked graphs; that safe labelled marked graphs can be transformed into τ*-free safe labelled marked graphs; and that marked graphs can be separated. The paper also lists some open problems that have arisen in this context.