On interleaving in P,A-Time Petri nets with strong semantics

Hanifa Boucheneb
(Laboratoire VeriForm, École Polytechnique de Montréal, Canada)
Kamel Barkaoui
(Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, France)

This paper deals with the reachability analysis of P,A-Time Petri nets (P,A-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set of transitions. In BB08, the authors have considered the T-TPN model and its Contracted State Class Graph (CSCG) and shown that this union is not necessarily convex. They have however established some sufficient conditions which ensure convexity. This paper shows that for the CSCG of P,A-TPN, this union is convex and can be computed without computing intermediate state classes. These results allow to improve the forward reachability analysis by agglomerating, in the same state class, all state classes reached by different interleavings of the same set of transitions (abstraction by convex-union).

In Yu-Fang Chen and Ahmed Rezine: Proceedings 12th International Workshop on Verification of Infinite-State Systems (INFINITY 2010), Singapore, 21st September 2010, Electronic Proceedings in Theoretical Computer Science 39, pp. 17–31.
Published: 28th October 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.39.2 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org