Theoretical Computer Science
Checking timed automata for linear duration properties
Journal of Computer Science and Technology
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
Checking Hybrid Automata for Linear Duration Invariants
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
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
On Checking Parallel Real-Time Systems for Linear Duration Properties
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
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
A User Guide to HyTech
Verification of Linear Duration Invariants by Model Checking CTL Properties
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Verifying linear duration constraints of timed automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In this paper, the problem of checking a timed automaton for a Duration Calculus formula of the form Temporal Duration Property is addressed. It is shown that Temporal Duration Properties are in the class of discretisable real-time properties of Timed Automata. and an algorithm is given to solve the problem based on linear programming techniques and the depth-first search method in the integral region graph of the automaton. The complexity of the algorithm is in the same class as that of the solution of the reachability problem of timed automata.