Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
Complexity results for 1-safe nets
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
Robust safety of timed automata
Formal Methods in System Design
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Compositional schedulability analysis of real-time systems using time Petri nets
IEEE Transactions on Software Engineering
Precise robustness analysis of time petri nets with inhibitor arcs
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
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.