Results 261 to 270 of about 2,669 (298)
Some of the next articles are maybe not open access.
In memory of Oded Maler: automatic reachability analysis of hybrid-state automata
SIGL, 2019Hybrid automata are an elegant formal model seamlessly integrating differential equations representing continuous dynamics with automata capturing switching behavior. Since the introduction of the computational model more than a quarter of a century ago [
M. Fränzle, Mingshuai Chen, P. Kröger
semanticscholar +1 more source
Reachability verification for hybrid automata
1998We 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
1995The 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, 2001Classical 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
2011The 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
Embeddings of Hybrid Automata in Process Algebra
2004We 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