A Fundamental Tehoerem of Asynchronous Parallel Computation
Proceedings of the Sagamore Computer Conference on Parallel Processing
Making Petri Nets Safe and Free of Internal Transitions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A decomposition theorem for finite persistent transition systems
Acta Informatica
Journal of Computer and System Sciences
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
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
On persistent reachability in Petri nets
Information and Computation
Step persistence in the design of GALS systems
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.