Specifying real-time properties with metric temporal logic
Real-Time Systems
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The benefits of relaxing punctuality
Journal of the ACM (JACM)
IEEE Spectrum
Parametric timing analysis for real-time systems
Information and Computation
Quantitative Temporal Reasoning
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Parametric Optimization of Open Real-Time Systems
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Journal of Computer and System Sciences
Towards Parametric Verification of Prioritized Time Petri Nets
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Hi-index | 0.00 |
We extend the standard model checking paradigm of linear temporal logic, LTL, to a "model measuring" paradigm where one can obtain more quantitative information beyond a "Yes/No" answer. For this purpose, we define a parametric temporal logic, PLTL, which allows statements such as "a request p is followed in at most x steps by a response q", where x is a free variable. We show how one can, given a formula ϕ(x1,..., xk) of PLTL and a system model K, not only determine whether there exists a valuation of x1,..., xk under which the system K satisfies the property ϕ, but if so find valuations which satisfy various optimality criteria. In particular, we present algorithms for finding valuations which minimize (or maximize) the maximum (or minimum) of all parameters. These algorithms exhibit the same PSPACE complexity as LTL model checking.We show that our choice of syntax for PLTL lies at the threshold of decidability for parametric temporal logics, in that several natural extensions have undecidable "model measuring" problems.