Results 221 to 230 of about 1,825 (259)

Rewarding probabilistic hybrid automata

Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013
The joint consideration of randomness and continuous time is important for the formal verification of many real systems. Considering both facets is especially important for wireless sensor networks, distributed control applications, and many other systems of growing importance. Apart from proving the quantitative safety of such systems, it is important
Ernst Moritz Hahn, Holger Hermanns
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

Implementation of Hybrid Automata in Scicos

2007 IEEE International Conference on Control Applications, 2007
Hybrid automaton is a standard model for describing a hybrid system. A hybrid automaton is a state machine augmented with differential equations and is generally represented by a graph composed of vertices and edges where vertices represent continuous activities and edges represent discrete transitions.
Masoud Najafi, Ramine Nikoukhah
openaire   +1 more source

Discreteness, hybrid automata, and biology

2008 9th International Workshop on Discrete Event Systems, 2008
Most of the observable natural phenomena exhibit a mixed discrete-continuous behavior characterized by laws changing according to a phase cycle. Such behaviors can be modeled in a very natural way by a class of automata called hybrid automata. In this class the evolution of measurable quantities, such as concentrations, is represented according to both
CASAGRANDE, A, PIAZZA, Carla, POLICRITI, Alberto   +2 more
openaire   +3 more sources

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

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

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

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 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

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