Results 251 to 260 of about 2,669 (298)

Lazy Rectangular Hybrid Automata

2004
We introduce the class of lazy rectangular hybrid automata. The key feature of this class is that both the observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. We show that the discrete time dynamics of this class of automata can be effectively analyzed without requiring resetting of ...
Agrawal, M., Thiagarajan, P.S.
openaire   +1 more source

Counterexample Generation for Hybrid Automata

2014
The last decade brought us a whole range of over-approximative algorithms for the reachability analysis of hybrid automata, a widely used modeling language for systems with combined discrete-continuous behavior. Besides theoretical results, there are also some tools available for proving safety in the continuous time domain.
Johanna Nellen, Erika Ábrahám, Xin Chen 0002, Pieter Collins   +3 more
openaire   +1 more source

Hybrid Automata and Bisimulation [PDF]

, 2010
This paper surveys hybrid automata and bisimulation relations. We formally introduce both notions and briefly present the model checking problem over hybrid automata. We show how, in some cases, bisimulations can be used to quotient infinite state systems to finite ones and, hence, we reduce the model checking over hybrid automata to model checking ...
openaire   +2 more sources

Cellular automata-based multi-objective hybrid grey wolf optimization and particle swarm optimization algorithm for wellbore trajectory optimization

, 2020
: Wellbore trajectory design is a nonlinear and constrained mathematical optimization problem that is used to build a cost-efficient, safe, and easily reachable trajectory.
K. Biswas, P. Vasant, J. A. G. Vintaned, J. Watada   +3 more
semanticscholar   +1 more source

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

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 0001, Mahesh Viswanathan 0001   +3 more
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

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