Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs

Authors:
Hanifa Boucheneb;Kamel Barkaoui
Affiliations:
Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Canada H3C 3A7;Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, Paris, France
Venue:
Discrete Event Dynamic Systems
Year:
2011

Citing 11
Cited 0

Efficient Verification of Parallel Real–Time Systems

Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Analyzing paths in time petri nets

Fundamenta Informaticae - Special issue on Petri nets
Introduction to Algorithms

Introduction to Algorithms
State space computation and analysis of Time Petri Nets

Theory and Practice of Logic Programming
CTL* model checking for time Petri nets

Theoretical Computer Science
Lower and upper bounds in zone-based abstractions of timed automata

International Journal on Software Tools for Technology Transfer (STTT)
A more efficient time Petri net state space abstraction preserving linear properties

ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
On-the-fly TCTL model checking for time Petri nets

Theoretical Computer Science
TCTL Model Checking of Time Petri Nets

Journal of Logic and Computation
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
Model checking bounded prioritized time Petri nets

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here the time Petri nets (the TPN model) and its state space abstractions. We show that only some timed schedules/clock vectors (one per enabled transition) of the clock/firing domains are relevant to construct reachability graphs for the TPN. Moreover, we prove formally that the resulting graphs are smaller than the TPN reachability graphs proposed in the literature. Furthermore, these results establish a relation between dense time and discrete time analysis of time Petri nets and allow also improving discrete time analysis by considering only some elements of the clock/firing domains.