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
The benefits of relaxing punctuality
Journal of the ACM (JACM)
IEEE Spectrum
Parametric timing analysis for real-time systems
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Decidable first-order transition logics for PA-processes
Information and Computation
Ranking Automata and Games for Prioritized Requirements
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Optimal Strategy Synthesis in Request-Response Games
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Formal Methods in System Design
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
Decidable first-order transition logics for PA-processes
Information and Computation
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Automated assumption generation for compositional verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Optimizing winning strategies in regular infinite games
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Taming the component timing: a CBD methodology for real-time embedded systems
Proceedings of the Conference on Design, Automation and Test in Europe
Promptness in w-regular automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Some results on Parametric Temporal Logic
Information Processing Letters
Parametric metric interval temporal logic
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Consistency of service composition
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Decision problems for lower/upper bound parametric timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Optimal bounds in parametric LTL games
Theoretical Computer Science
An interface theory for service-oriented design
Theoretical Computer Science
A fuzzy real-time temporal logic
International Journal of Approximate Reasoning
Automata-theoretic decision of timed games
Theoretical Computer Science
| 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 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. Theses 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.