259 search results - page 13 / 52 » Bounded Model Checking for Timed Automata |
120
click to vote
CAV
1994
Springer
15 years 1 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
STACS
2001
Springer
15 years 1 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
RTSS
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
FORMATS
2005
Springer
15 years 3 months ago
2005
Springer
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
67
Voted
ATVA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...