Results 231 to 240 of about 1,825 (259)

Series of Abstractions for Hybrid Automata

2002
We present a technique based on the use of the quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The
Ashish Tiwari 0001, Gaurav Khanna 0001
openaire   +1 more source

Superposition Principle in Composable Hybrid Automata

Fundamenta Informaticae, 2018
Hybrid automata are a well-established modelling approach. The formalism is used in many real-time and control systems engineering projects, which makes model composition an increasingly relevant topic. A well-defined composition support allows concurrent engineering activities and the validation of larger systems.
Jafar Akhundov, Peter Tröger, Matthias Werner 0001   +2 more
openaire   +1 more source

Reachability verification for hybrid automata

1998
We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which
Thomas A. Henzinger, Vlad Rusu
openaire   +1 more source

Hybrid automata with finite bisimulations

1995
The analysis, verification, and control of hybrid automata with finite bisimulations can be reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for checking if a given hybrid automaton has a finite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the ...
openaire   +1 more source

Automata, Circuits, and Hybrids: Facets of Continuous Time

Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001
Classical Automata Theory (AT) is mainly about devices that operate in discrete time. Recent research stimulated the interest to, and the development of, paradigms in which continuous time is involved whether in a pure way or in cooperation with discrete time.
openaire   +1 more source

Reachability Problems for Hybrid Automata

2011
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This negative result has triggered several research lines, leading among others to: - the definition of subclasses of hybrid automata with a decidable reachability problem; - the definition of semi-algorithms that are useful in practice to attack the ...
openaire   +2 more sources

A Novel Hybrid Approach Based on Cellular Automata and a Digital Elevation Model for Rapid Flood Assessment

Water (Switzerland), 2021
Tsunhua Yang, Obaja Triputera Wijaya
exaly  

Embeddings of Hybrid Automata in Process Algebra

2004
We study the expressive power of two modelling formalisms, viz. hybrid automata and µCRL t . The automaton based language of hybrid automata is a popular formalism that is used for describing and analysing the behaviours of hybrid systems. The process algebraic language µCRL t is designed for specifying real-time and data-dependent systems and to ...
openaire   +3 more sources

An Introduction to Hybrid Automata

2005
ion methods are used to simplify models and make their analysis more tractable. Several equivalence relations have been studied for subclasses of hybrid systems. For example, it can be shown that transition systems of timed automata admit finite state abstractions, called region graphs, that are time-abstract bisimilar, see [7] for details.
openaire   +2 more sources

A Passive Online Technique for Learning Hybrid Automata from Input/Output Traces

Transactions on Embedded Computing Systems, 2023
Fathiyeh Faghih, Iman Saberi Tirani, Farzad Sobhi   +2 more
exaly