scholarly journals Efficient Verification of Timed Automata with BDD-Like Data-Structures

2002 ◽  
pp. 189-205 ◽  
Author(s):  
Farn Wang
Keyword(s):  
Data Structures ◽  
Timed Automata ◽  
Efficient Verification

scholarly journals Data-structures for the verification of timed automata

1997 ◽  
pp. 346-360 ◽  
Author(s):  
Eugene Asarin ◽  
Marius Bozga ◽  
Alain Kerbrat ◽  
Oded Maler ◽  
Amir Pnueli ◽  
...  
Keyword(s):  
Data Structures ◽  
Timed Automata

scholarly journals Timed Automata May Cause Some Troubles

2002 ◽  
Vol 9 (35) ◽  
Author(s):  
Patricia Bouyer
Keyword(s):  
Data Structures ◽  
General Framework ◽  
Timed Automata ◽  
Exact Computation ◽  
Analysis Algorithm ◽  
Forward Analysis

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.<br /> <br />In this paper, we study in details this widening operator and the forward analysis algorithm that uses it. This algorithm is most used and implemented in tools like Kronos and Uppaal. One of our main results is that it is hopeless to find a forward analysis algorithm, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in details this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found.

scholarly journals Minimum-Cost Reachability for Priced Timed Automata

2001 ◽  
Vol 8 (3) ◽  
Author(s):  
Gerd Behrmann ◽  
Ansgar Fehnker ◽  
Thomas S. Hune ◽  
Kim G. Larsen ◽  
Paul Pettersson ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Data Structures ◽  
Timed Automata ◽  
Minimum Cost ◽  
Initial State ◽  
Reachability Problem ◽  
Algorithmic Solution ◽  
The Cost ◽  
Branch And Bound Techniques ◽  
Timed Automaton

<p>This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target<br />state, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.</p><p>Keywords: Timed Automata, Verification, Data Structures, Algorithms,<br />Optimization.</p>

Reachability results for timed automata with unbounded data structures

2010 ◽  
Vol 47 (5-6) ◽  
pp. 279-311 ◽  
Author(s):  
Ruggero Lanotte ◽  
Andrea Maggiolo-Schettini ◽  
Angelo Troina
Keyword(s):  
Data Structures ◽  
Timed Automata
Sign in / Sign up

Export Citation Format

Share Document