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 algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Model checking restricted sets of timed paths
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Concavely-Priced Timed Automata
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Reachability problems on extended o-minimal hybrid automata
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Timed temporal logics for abstracting transient states
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We present a verification algorithm for duration properties ofreal-time systems. While simple real-time properties constrain thetotal elapsed time between events, duration properties constrain theaccumulated satisfaction time of state predicates. We formalize theconcept of durations by introducing duration measures for timedautomata. A duration measure assigns to each finite run of a timedautomaton a real number —the duration ofthe run— which may be the accumulated satisfaction time of astate predicate along the run. Given a timed automaton with aduration measure, an initial and a final state, and an arithmeticconstraint, the duration-bounded reachability problem asks if there is a run of the automaton from theinitial state to the final state such that the duration of the runsatisfies the constraint. Our main result is an (optimal) PSPACE decision procedure for the duration-bounded reachability problem.