On MITL and Alternating Timed Automata over Infinite Words

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-319-10512-3_6 ◽

2014 ◽

pp. 69-84 ◽

Cited By ~ 4

Author(s):

Thomas Brihaye ◽

Morgane Estiévenart ◽

Gilles Geeraerts

Keyword(s):

Timed Automata ◽

Infinite Words

Download Full-text

Infinite Words - Automata, Semigroups, Logic and Games

10.1016/s0079-8169(04)x8001-6 ◽

2004 ◽

Keyword(s):

Infinite Words

Download Full-text

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

Chinese Journal of Computers ◽

10.3724/sp.j.1016.2011.01365 ◽

2011 ◽

Vol 34 (8) ◽

pp. 1365-1377 ◽

Cited By ~ 11

Author(s):

Li-Xing LI ◽

Zhi JIN ◽

Ge LI

Keyword(s):

Internet Of Things ◽

Timed Automata

Download Full-text

Robust Model Checking of Timed Automata under Clock Drifts

Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control - HSCC '17 ◽

10.1145/3049797.3049821 ◽

2017 ◽

Cited By ~ 2

Author(s):

Nima Roohi ◽

Pavithra Prabhakar ◽

Mahesh Viswanathan

Keyword(s):

Model Checking ◽

Timed Automata ◽

Robust Model

Download Full-text

Priced Timed Automata Models for Control of Intelligent Product Agents in Manufacturing Systems

IFAC-PapersOnLine ◽

10.1016/j.ifacol.2021.04.051 ◽

2020 ◽

Vol 53 (4) ◽

pp. 136-142

Author(s):

Ilya Kovalenko ◽

Dawn Tilbury ◽

Kira Barton

Keyword(s):

Manufacturing Systems ◽

Timed Automata ◽

Intelligent Product

Download Full-text

Adaptive Cruise Control with Timed Automata

IFAC-PapersOnLine ◽

10.1016/j.ifacol.2020.12.2585 ◽

2020 ◽

Vol 53 (2) ◽

pp. 1918-1923

Author(s):

Mustafa Yavuz Kara ◽

Ebru Aydin Gol

Keyword(s):

Adaptive Cruise Control ◽

Timed Automata ◽

Cruise Control

Download Full-text

Configurable verification of timed automata with discrete variables

Acta Informatica ◽

10.1007/s00236-020-00393-4 ◽

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.

Download Full-text