Modalities for model checking: branching time logic strikes back
Science of Computer Programming
More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Introduction to algorithms
Handbook of theoretical computer science (vol. B)
Techniques for automatic verification of real-time systems
Techniques for automatic verification of real-time systems
Quantitative temporal reasoning
Real-Time Systems
Journal of the ACM (JACM)
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
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)
On the complexity of unique solutions
Journal of the ACM (JACM)
Model checking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On Solving Temporal Logic Queries
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Model checking durational probabilistic systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied.We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap between logics where subscripts of the form "= c" (exact duration) are allowed, and simpler logics that only allow subscripts of the form "驴 c" or "驴 c" (bounded duration).A surprising outcome of this study is that it provides the second example of a 驴p2-complete model checking problem.