Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic

We consider the problem of model-checking a parametric extension of the logic TCTL over timed automata and establish its decidability. Given a timed automaton, we show that the set of durations of runs starting from a region and ending in another region is definable in the arithmetic of Presburger (when the time domain is discrete) or in the theory of the reals (when the time domain is dense). With this logical definition, we show that the parametric model-checking problem for the logic TCTL can easily be solved. More generally, we are able to effectively characterize the values of the parameters that satisfy the parametric TCTL formula.

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

[2]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[3]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

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

[5]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[6]  Pierre Wolper,et al.  On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables , 2001, IJCAR.

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

[8]  Hubert Comon-Lundh,et al.  Timed Automata and the Theory of Real Numbers , 1999, CONCUR.

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

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

[11]  Farn Wang,et al.  Timing behavior analysis for real-time systems , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.