Model checking of time Petri nets

Authors:
Hanifa Boucheneb;Rachid Hadjidj
Affiliations:
Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec;Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec
Venue:
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2007

Citing 11
Cited 0

Model checking

Model checking
Analysis of Timed Systems Using Time-Abstracting Bisimulations

Formal Methods in System Design
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Partial Order Method for the Verification of Time Petri Nets

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Time Constraints Verification Methods Based on Time Petri Nets

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
Much Compact Time Petri Net State Class Spaces Useful to Restore CTL* Properties

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Checking Timed Büchi Automata Emptiness Efficiently

Formal Methods in System Design
CTL* model checking for time Petri nets

Theoretical Computer Science
On-the-fly TCTL model checking for Time Petri Nets using state class graphs

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Improving state class constructions for CTL* model checking of time Petri nets

International Journal on Software Tools for Technology Transfer (STTT)
State class constructions for branching analysis of time Petri nets

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers time Petri nets (TPN model) for model checking. The main challenge in model checking techniques is to construct, with lesser resources (time and space), a much coarser abstraction preserving properties of interest. These properties can be verified using standard model checking techniques. In this paper, we review some techniques, proposed in the literature, to model check untimed and timed properties of the TPN.