This paper surveys hybrid automata and bisimulation relations. We formally introduce both notions and brie\ufb02y present the model checking problem over hybrid automata. We show how, in some cases, bisimulations can be used to quotient in\ufb01nite state systems to \ufb01nite ones and, hence, we reduce the model checking over hybrid automata to model checking over \ufb01nite models. Finally, we review some classes of hybrid automata which admit \ufb01nite bisimulation quotients
Simulation and bisimulation relations define pre-orders on processes which serve as the basis for ap...
Hybrid systems are dynamical systems with the ability to describe mixed discrete-continuous evolutio...
We consider the class of o-minimally definable hybrid automata with a bounded discrete-transition ho...
Abstract. This paper surveys hybrid automata and bisimulation rela-tions. We formally introduce both...
Many systems, both natural and artificial, exhibit a mixed discrete-continuous behavior that cannot ...
AbstractWe view CCS terms as defining nondeterministic automata. An algebraic representation of auto...
Bisimulation is a seemingly attractive state-space minimization technique because it can be computed...
A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Conne...
Many systems, both natural and artificial, exhibit a mixed discrete-continuous behavior that cannot ...
AbstractHybrid systems are dynamical systems with the ability to describe mixed discrete-continuous ...
Hybrid systems are dynamical systems with the ability to describe mixed discrete- continuous evoluti...
We present a system that performs computations on finite state machines, syntactic semi groups, and ...
A general notion of hybrid bisimulation is proposed and related to the notions of algebraic, state-s...
A general notion of hybrid bisimulation is proposed and related to the notions of algebraic, state-s...
The use of formal methods, techniques and tools may generally guarantee a systems ’ safe operation. ...
Simulation and bisimulation relations define pre-orders on processes which serve as the basis for ap...
Hybrid systems are dynamical systems with the ability to describe mixed discrete-continuous evolutio...
We consider the class of o-minimally definable hybrid automata with a bounded discrete-transition ho...
Abstract. This paper surveys hybrid automata and bisimulation rela-tions. We formally introduce both...
Many systems, both natural and artificial, exhibit a mixed discrete-continuous behavior that cannot ...
AbstractWe view CCS terms as defining nondeterministic automata. An algebraic representation of auto...
Bisimulation is a seemingly attractive state-space minimization technique because it can be computed...
A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Conne...
Many systems, both natural and artificial, exhibit a mixed discrete-continuous behavior that cannot ...
AbstractHybrid systems are dynamical systems with the ability to describe mixed discrete-continuous ...
Hybrid systems are dynamical systems with the ability to describe mixed discrete- continuous evoluti...
We present a system that performs computations on finite state machines, syntactic semi groups, and ...
A general notion of hybrid bisimulation is proposed and related to the notions of algebraic, state-s...
A general notion of hybrid bisimulation is proposed and related to the notions of algebraic, state-s...
The use of formal methods, techniques and tools may generally guarantee a systems ’ safe operation. ...
Simulation and bisimulation relations define pre-orders on processes which serve as the basis for ap...
Hybrid systems are dynamical systems with the ability to describe mixed discrete-continuous evolutio...
We consider the class of o-minimally definable hybrid automata with a bounded discrete-transition ho...