Results 241 to 250 of about 38,502 (282)

Diagnosability Verification for Hybrid Automata

2007
We define a notion of diagnosability for hybrid automata, which generalizes the notion of observability. We propose a procedure to check diagnosability on a given hybrid automaton, and show that the complexity of the verification problem is in PTIME. We apply our procedure to an electromagnetic valve system for camless engines.
DI BENEDETTO, MARIA DOMENICA, S. Di Gennaro, D'INNOCENZO, ALESSANDRO   +2 more
openaire   +3 more sources

Model Checking on Hybrid Automata

2012 15th Euromicro Conference on Digital System Design, 2012
Many systems, both natural and artificial, exhibit a mixed discrete-continuous behavior that cannot be fully cap- tured by either continuous nor discrete models: they evolve in accordance to continuous laws, but these laws are controlled by a finite set of modes.
Alberto Casagrande, Carla Piazza
openaire   +2 more sources

Timed and Hybrid Automata in SAL

2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2008
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We show how to translate the system into a SAL model with the time domain being either discrete or dense, and the clocks being either ...
P. Vijay Suman, Paritosh K. Pandya
openaire   +1 more source

Introduction to Hybrid Automata

2012
Pavithra Prabhakar
exaly   +2 more sources

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

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

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