Paper Info
Title
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. These constraints are given 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 1-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.
Year
DOI
Venue
2012
10.1007/978-3-642-33365-1_3
FORMATS
Keywords
Field
DocType
architectural constraint,specification net,silent transition,external architecture,additional time,time petri net,time petri nets,robustness property,1-safe tpns,robustness issue,untimed behavior,main objective
Discrete event system,Petri net,Injective function,Computer science,Scheduling (computing),Supervisory control,Theoretical computer science,Robustness (computer science),Decidability,Undecidable problem
Conference
Citations 
PageRank 
References 
1
0.36
9
Authors
5
Name
Order
Citations
PageRank
S. Akshay110.36
Loïc Hélouët228125.37
claude jard31155101.84
didier lime478746.02
olivier h roux567146.30