Forward Analysis of Timed Automata with Action Durations: Theory and Implementation

2014 ◽  
Author(s):  
Souad Guellati ◽  
Ilham Kitouni ◽  
Riadh Matmat ◽  
Djamel Eddine Saidouni
Keyword(s):  
Timed Automata ◽  
Forward Analysis

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.

Modeling and Verifying Services of Internet of Things Based on Timed Automata

2011 ◽  
Vol 34 (8) ◽  
pp. 1365-1377 ◽  
Author(s):  
Li-Xing LI ◽  
Zhi JIN ◽  
Ge LI
Keyword(s):  
Internet Of Things ◽  
Timed Automata

scholarly journals Adaptive Cruise Control with Timed Automata

2020 ◽  
Vol 53 (2) ◽  
pp. 1918-1923
Author(s):  
Mustafa Yavuz Kara ◽  
Ebru Aydin Gol
Keyword(s):  
Adaptive Cruise Control ◽  
Timed Automata ◽  
Cruise Control

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

Sign in / Sign up

Export Citation Format

Share Document