Robust parametric reachability for timed automata

Authors:
Laurent Doyen
Affiliations:
School of Computer and Communication Sciences, Swiss Federal Institute of Technology (EPFL), Sweden
Venue:
Information Processing Letters
Year:
2007

Citing 7
Cited 2

Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A theory of timed automata

Theoretical Computer Science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
Parametric Analysis of Computer Systems

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
A Comparison of Control Problems for Timed and Hybrid Systems

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Parametric Quantitative Temporal Reasoning

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines

Bounded model checking for parametric timed automata

Transactions on Petri Nets and Other Models of Concurrency V
Integer parameter synthesis for timed automata

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

We review the known decidability and undecidability results for reachability in parametric timed automata. Then, we present a new proof of undecidability in dense time for open timed automata that avoids equalities in clock constraints. Our result shows that the undecidability of parametric timed automata does not follow from their ability to specify punctual constraints in a dense time domain.