Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Analysis of Slope-Parametric Rectangular Automata
Hybrid Systems V
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
A Symbolic Decision Procedure for Robust Safety of Timed Systems
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
Robust safety of timed automata
Formal Methods in System Design
Dynamical properties of timed automata revisited
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Probabilistic and topological semantics for timed automata
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Symbolic robustness analysis of timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Fast acceleration of ultimately periodic relations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
Robust specification of real time components
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
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
Robust synthesis for real-time systems
Theoretical Computer Science
Information and Computation
| Hi-index | 0.00 |
Whereas formal verification of timed systems has become a very active field of research, the idealized mathematical semantics of timed automata cannot be faithfully implemented. Recently, several works have studied a parametric semantics of timed automata related to implementability: if the specification is met for some positive value of the parameter, then there exists a correct implementation. In addition, the value of the parameter gives lower bounds on sufficient resources for the implementation. In this work, we present a symbolic algorithm for the computation of the parametric reachability set under this semantics for flat timed automata. As a consequence, we can compute the largest value of the parameter for a timed automaton to be safe.