Improving state class constructions for CTL* model checking of time Petri nets

Authors:
Rachid Hadjidj;Hanifa Boucheneb
Affiliations:
École Polytechnique de Montréal, Department of Computer Engineering, P.O. Box 6079, Station Centre-ville, Montréal, QC, Canada;École Polytechnique de Montréal, Department of Computer Engineering, P.O. Box 6079, Station Centre-ville, Montréal, QC, Canada
Venue:
International Journal on Software Tools for Technology Transfer (STTT)
Year:
2008

Citing 0
Cited 2

Model checking of time Petri nets

VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets

ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state space explosion is still one of the most challenging problems in formal verification using enumerative techniques. The challenge is even greater for real time systems whose state spaces are generally infinite due to time density. To use enumerative techniques with these systems, their state spaces need to be contracted into finite structures that preserve properties of interest. We propose in this paper an efficient approach to construct a contraction of the time Petri net model state space, which preserves its CTL* properties.