“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Handbook of theoretical computer science (vol. B)
Model-checking in dense real-time
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
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance
Formal Methods in System Design
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
The power of reachability testing for timed automata
Theoretical Computer Science
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed temporal logics for abstracting transient states
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called "Until almost everywhere". In the extended logic, it is possible, for instance, to express that a property is true at all positions of all runs, except on a negligible set of positions. Such properties are very convenient, for example in the framework of boolean program verification, where transitions result from changing variable values. We investigate the expressive power of this modality and in particular, we prove that it cannot be expressed with classical TCTL modalities. However, we show that model-checking the extended logic remains PSPACE-complete as for TCTL.