Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Parametric Analysis of Computer Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Parametric Temporal Logic for "Model Measuring"
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
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
Information flow in hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Journal of Computer and System Sciences
Model checking restricted sets of timed paths
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
An automata-theoretic approach to constraint LTL
Information and Computation
Towards Parametric Verification of Prioritized Time Petri Nets
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Beyond liveness: efficient parameter synthesis for time bounded liveness
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Timed temporal logics for abstracting transient states
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Decision problems for lower/upper bound parametric timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| 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 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.