Theoretical Computer Science
Model checking
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
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
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
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Towards Refining Temporal Specifications into Hybrid Systems
Hybrid Systems
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Checking temporal duration properties of timed automata
Journal of Computer Science and Technology
On Checking Parallel Real-Time Systems for Linear Duration Invariants
PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed 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)
Verification of Linear Duration Invariants by Model Checking CTL Properties
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A theory of duration calculus with application
Domain modeling and the duration calculus
Model checking linear duration invariants of networks of automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Bounded model-checking of discrete duration calculus
Proceedings of the 16th international conference on Hybrid systems: computation and control
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper aims at developing a technique for checking if a timed automaton satisfies a linear duration constraint on the automaton states. The constraints are represented in the form of linear duration invariants – a simple class of chop-free Duration Calculus (DC) formulas. We prove that linear duration invariants of timed automata are discretisable, and reduce checking if a timed automaton satisfies a linear duration invariant to checking if the integer timed region graph of the original automaton satisfies the same linear duration invariant. The latter can be done with exhaustive search on graphs. In comparison to the techniques in the literature, our method is more powerful: it works for the standard semantics of DC and the class of the closed timed automata while the others cannot be applied.