Results 251 to 260 of about 38,502 (282)

Combining hybrid Petri nets and hybrid automata

IEEE Transactions on Robotics and Automation, 2001
Hybrid systems have received much attention and a number of different models have been proposed in order to establish a mathematical framework which is able to handle both continuous and discrete aspects. Our research is focused on two models: hybrid automata and hybrid Petri nets (hybrid PNs). First, we deal with studying the hybrid PN functioning. An
Alexandru Tiberiu Sava, Hassane Alla
openaire   +1 more source

Uniformity for the decidability of hybrid automata

1996
We present some new decidability results on the verification of hybrid automata by symbolic analysis (abstract interpretation using polyhedra). The results include defining a class of hybrid automata for which all properties expressed in the real-time temporal logic Tctl are decidable.
Olivier F. Roux, Vlad Rusu
openaire   +1 more source

Hybrid automata-based CEGAR for rectangular hybrid systems

Formal Methods in System Design, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavithra Prabhakar, Parasara Sridhar Duggirala, Sayan Mitra 0002, Mahesh Viswanathan 0001   +3 more
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

Hybrid automata in systems biology

2022
In this chapter, the authors discuss a number of formal tools collectively driving them to Hybrid Automata. Automata have a long and rich history in computer science, and they have been used in a variety of ways to render (formally) many basic and natural ideas.
Casagrande A., Gentilini R., Piazza C., Policriti A.   +3 more
openaire   +2 more sources

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

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

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

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