Relevant Timed Schedules / Clock Valuations 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, Québec, Canada H3C 3A7;Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, Paris Cedex 03, France
Venue:
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Year:
2008

Citing 7
Cited 2

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
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
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

Modelling and Analysis of Time-Constrained Flexible Workflows with Time Recursive ECATNets

Web Services and Formal Methods
SAT-based (parametric) reachability for a class of distributed time Petri nets

Transactions on Petri nets and other models of concurrency IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here time Petri nets (the TPN model) and two of its state space abstractions: the state class graph (SCG) and the zone based graph (ZBG). We show that only some time points of the clock/firing domains of abstract states are relevant to construct a TPN reachability graph. Moreover, for the state class graph method, the graph computed using relevant time points is smaller than the SCG.