Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
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
Journal of Computer and System Sciences
From time Petri nets to timed automata: an untimed approach
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Untimed language preservation in timed systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Robust model-checking of timed automata via pumping in channel machines
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Systematic implementation of real-time models
FM'05 Proceedings of the 2005 international conference on Formal Methods
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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 |
Robustness of timed systems aims at studying whether infinitesimal perturbations in clock values can result in new discrete behaviors. A model is robust if the set of discrete behaviors is preserved under arbitrarily small (but positive) perturbations. We tackle this problem for Time Petri Nets (TPNs for short) by considering the model of parametric guard enlargement which allows time-intervals constraining the firing of transitions in TPNs to be enlarged by a (positive) parameter. We show that TPNs are not robust in general and checking if they are robust with respect to standard properties (such as boundedness, safety) is undecidable. We then extend the marking class timed automaton construction for TPNs to a parametric setting, and prove that it is compatible with guard enlargements. We apply this result to the (undecidable) class of TPNs which are robustly bounded (i.e., whose finite set of reachable markings remains finite under infinitesimal perturbations): we provide two decidable robustly bounded subclasses, and show that one can effectively build a timed automaton which is timed bisimilar even in presence of perturbations. This allows us to apply existing results for timed automata to these TPNs and show further robustness properties.