Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Elements of the Theory of Computation
Elements of the Theory of Computation
Parametric Analysis of Computer Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Timing behavior analysis for real-time systems
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded parametric model checking for elementary net systems
Transactions on Petri nets and other models of concurrency IV
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Parametric metric interval temporal logic
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
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 Presburger arithmetic (when the time domain is discrete) or in a real arithmetic (when the time domain is dense). Using this logical definition, we show that the parametric model-checking problem for the logic TCTL can be solved algorithmically; the proof of this result is simple. More generally, we are able to effectively characterize the values of the parameters that satisfy the parametric TCTL formula with respect to the given timed automaton.