“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Theoretical Computer Science
Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking Linear Duration Invariants by Linear Programming
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Duration Specifications for Shared Processors
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Formal Proof of the Deadline Driven Scheduler
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Sampling Semantics of Duration Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
On Checking Timed Automata for Linear Duration Invariants
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
Model-checking dense-time Duration Calculus
Formal Aspects of Computing
Verification of Linear Duration Invariants by Model Checking CTL Properties
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Deciding an interval logic with accumulated durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verifying linear duration constraints of timed automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Model checking duration calculus: a practical approach
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Bounded model-checking of discrete duration calculus
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.01 |
Linear duration invariants (LDIs) are important safety properties of real-time systems. In this paper, we reduce the problem of verification of a network of timed automata against an LDI to an equivalent problem of model checking whether a failure state is never reached. Our approach is first to transform each component automaton ${\mathcal A}_i$ of the network ${\mathcal A}$ to an automaton ${\mathcal G}$. The transformation helps us to record entry and exit to critical locations that appear in the LDI. We then introduce an auxiliary checker automaton ${\mathcal S}$ and define a failure state to verify the LDI on a given interval. Since a model checker checks exhaustively, a failure of the checker automaton to find the failure state will prove that the LDI holds.