论文信息 - Robust parametric reachability for timed automata

Robust parametric reachability for timed automata

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.

Laurent Doyen | L. Doyen

[1] Véronique Bruyère,et al. Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic , 2003, STACS.

[2] Thomas A. Henzinger,et al. The benefits of relaxing punctuality , 1991, PODC '91.

[3] Thomas A. Henzinger,et al. Parametric real-time reasoning , 1993, STOC.

[4] Joseph S. Miller. Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata , 2000, HSCC.

[5] Pao-Ann Hsiung,et al. Parametric Analysis of Computer Systems , 1997, AMAST.

[6] Véronique Bruyère,et al. Real-Time Model-Checking: Parameters everywhere , 2003, Log. Methods Comput. Sci..

[7] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[8] Frits W. Vaandrager,et al. Linear parametric model checking of timed automata , 2002, J. Log. Algebraic Methods Program..

[9] Rajeev Alur,et al. Parametric Temporal Logic for "Model Measuring" , 1999, ICALP.

[10] E. Allen Emerson,et al. Parametric quantitative temporal reasoning , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[11] Thomas A. Henzinger,et al. A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.