A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets

Characterizing Liveness of Petri Nets in Terms of Siphons

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets

A structural verification of web services composition compatibility

Proceedings of the 6th International Workshop on Enterprise & Organizational Modeling and Simulation

Finding a witness path for non-liveness in free-choice nets

PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets

On the equivalence between liveness and deadlock-freeness in petri nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

New algorithms for deciding the siphon-trap property

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets