Robustness of Time Petri Nets under architectural constraints

Abstract : This paper addresses robustness issues in Time Petri Nets (TPN) under constraints imposed by an external architecture. The main objective is to check whether a timed specification, given as a TPN behaves as expected when subject to additional time and scheduling constraints, specified by another TPN that constrains the specification via read arcs. Our robustness property says that the constrained net does not exhibit new timed or untimed behaviors. We show that this property is not always guaranteed but that checking for it is always decidable in 1-safe TPNs. We further show that checking if the set of untimed behaviors of the constrained and specification nets are the same is also decidable. Next we turn to the more powerful case of labeled 1-safe TPNs with silent transitions. We show that checking for the robustness property is undecidable even when restricted to 1-safe TPNs with injective labeling, and exhibit a sub-class of safe TPNs (with silent transitions) for which robustness is guaranteed by construction. We demonstrate the practical utility of this sub-class with a case-study and prove that it already lies close to the frontiers of intractability.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00879818
Contributor : Loic Helouet <>
Submitted on : Tuesday, November 5, 2013 - 12:09:11 PM
Last modification on : Thursday, February 7, 2019 - 3:02:00 PM
Long-term archiving on : Thursday, February 6, 2014 - 4:34:27 AM

File

FORMATS12_AHJLR12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00879818, version 1

Citation

Sundararaman Akshay, Loic Helouet, Claude Jard, Didier Lime, Olivier Henri Roux. Robustness of Time Petri Nets under architectural constraints. Formal Modeling and Analysis of Timed Systems, Sep 2013, Warwik, United Kingdom. pp.11-26. ⟨hal-00879818⟩

Share

Metrics

Record views

2507

Files downloads

209