The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The power of the future perfect in program logics
Information and Control
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
Specifying real-time properties with metric temporal logic
Real-Time Systems
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
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Real-time symbolic model checking for discrete time models
Theories and experiences for real-time system development
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Symbolic model checking for event-driven real-time systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of unique solutions
Journal of the ACM (JACM)
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
The Verus language: representing time efficiently with BDDs
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
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
Journal of Algorithms
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
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th 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
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Timing analysis of industrial real-time systems
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
BTL2 and the expressive power of ECTL+
Information and Computation
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model checking durational probabilistic systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Diagnosability verification for hybrid automata
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Syntax and semantics for business rules
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV
Model-checking timed ATL for durational concurrent game structures
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Time-bounded analysis of real-time systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Timed CTL model checking in real-time maude
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
On-Line detection and prediction of temporal patterns
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
| Hi-index | 5.23 |
We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions ofCTL where subscripts put quantitative constraints on the time it takes before a property is satisfied.We 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).Without exact durations, model checking can be done in polynomial time, but with exact durations, it becomes δ2p-complete or PSPACE-complete depending on the considered semantics.