Results 211 to 220 of about 1,825 (259)

(Hybrid) automata and (stochastic) programs * The hybrid automata lattice of a stochastic program

Journal of Logic and Computation, 2011
We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left.
Luca Bortolussi, Alberto Policriti
openaire   +3 more sources

Polyhedral Flows in Hybrid Automata

Formal Methods in System Design, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ALUR R, KANNAN S, LA TORRE, Salvatore
openaire   +2 more sources

On Transfinite Hybrid Automata

2005
In this paper, we propose a new method to deal with hybrid systems based on the concept of the nonstandard analysis and the Buchi's transfinite automata. An essential point of the method is a generalization of hybrid automata with hyperfinite iteration of an infinitesimal transition in * ℝ.
Katsunori Nakamura, Akira Fusaoka
openaire   +1 more source

The theory of hybrid automata

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 2000
We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
openaire   +1 more source

Introduction to Hybrid Automata

2012
Pavithra Prabhakar
exaly   +2 more sources

Hybrid automata

2009
Hybrid automata is a modeling formalism for hybrid systems that results from an extension of finite-state machines by associating with each discrete state a continuous-state model. Conditions on the continuous evolution of the system invoke discrete state transitions.
Kowalewski, S, GARAVELLO, MAURO, Guéguen, H, Herberich, G, Langerak, R, Piccoli, B, Polderman, J, Weise, C.   +7 more
openaire   +4 more sources

Observability of Hybrid Automata by Abstraction

2006
In this paper, we deal with the observability problem of a class of Hybrid Systems whose output is a timed string on a finite alphabet. We determine under which conditions it is always possible to immediately detect, using the observed output, when the system enters a given discrete state.
D'INNOCENZO, ALESSANDRO, DI BENEDETTO, MARIA DOMENICA, DI GENNARO, Stefano   +2 more
openaire   +1 more source

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