A more efficient time Petri net state space abstraction preserving linear properties

Authors:
Hanifa Boucheneb;Hind Rakkay
Affiliations:
Ecole Polytechnique de Montreal, Canada;Ecole Polytechnique de Montreal, Canada
Venue:
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Year:
2007

Citing 0
Cited 3

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

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Modelling and Analysis of Time-Constrained Flexible Workflows with Time Recursive ECATNets

Web Services and Formal Methods
Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here Time Petri nets (TPN model). We first propose an abstraction to its generally infinite state space which preserves linear properties1 of the TPN model. Comparing with TPN abstractions proposed in the literature, our abstraction produces graphs which are both smaller and faster to compute. In addition, our characterization of abstracted states allows a significative gain in space. Afterwards, we show how to apply Yoneda's partial order reduction technique to construct directly reduced graphs useful to verify LTL-X properties of the model. Using our approach, both time and space complexities are significantly reduced.