Liveness verification of discrete event systems modeled by n-safe ordinary Petri nets

Authors:
Kevin X. He;Michael D. Lemmon
Affiliations:
Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Year:
2000

Citing 10
Cited 2

Branching processes of Petri nets

Acta Informatica
Using integer programming to verify general safety and liveness properties

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Free choice Petri nets

Free choice Petri nets
Symbolic Model Checking

Symbolic Model Checking
Model Checking Using Net Unfoldings

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On Liveness and Controlled Siphons in Petri Nets

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
A Structural Approach for the Analysis of Petri Nets by Reduced Unfoldings

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets

Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Liveness in Bounded Petri Nets Which Are Covered by T-Invariants

Proceedings of the 15th International Conference on Application and Theory of Petri Nets

Generalized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Control of Safe Ordinary Petri Nets Using Unfolding

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses liveness verification of discrete-event systems modeled by n-safe ordinary Petri nets. A Petri net is live, if it is possible to fire any transition from any reachable marking. The verification method we propose is based on a partial order method called network unfolding. Network unfolding maps the original Petri net to an acyclic occurrence net. A finite prefix of the occurrence net is defined to give a compact representation of the original net's reachability graph. A set of transition cycles is identified in the finite prefix. These cycles are then used to establish necessary and sufficient conditions that determine the original net's liveness.