Hybrid systems are used to model embedded computing systems interacting with their physical environment. There is a conceptual mismatch between high-level hybrid system languages like Simulink, which are used for simulation, and hybrid automata, the most suitable representation for safety verification. Indeed, in simulation languages the interaction between discrete and continuous execution steps is specified using the concept of zero-crossings, whereas hybrid automata exploit the notion of staying conditions. We describe a translation from a hybrid data-flow language to logico-numerical hybrid automata that treats this issue in detail. We examine various zero-crossing semantics, propose a sound translation, and discuss to which extent the ...
The use of formal methods, techniques and tools may generally guarantee a systems ’ safe operation. ...
Formal analysis of Simulink/Stateflow (SLSF) diagrams requires association of semantics to these dia...
Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical...
Hybrid systems are used to model embedded computing systems interacting with their physical environm...
International audienceHybrid systems are used to model embedded computing systems interacting with t...
Hybrid systems are used to model embedded computing systems interacting with their physical environm...
Physical systems can be naturally modeled by combining continuous and discrete models. Such hybrid m...
Physical systems can be naturally modeled by combining continuous and discrete models. Such hybrid m...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
Hybrid modelers such as SIMULINK have become corner stones of embedded systems development. They all...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
Hybrid modelers such as SIMULINK have become corner stones of embedded systems development. They all...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The use of formal methods, techniques and tools may generally guarantee a systems ’ safe operation. ...
Formal analysis of Simulink/Stateflow (SLSF) diagrams requires association of semantics to these dia...
Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical...
Hybrid systems are used to model embedded computing systems interacting with their physical environm...
International audienceHybrid systems are used to model embedded computing systems interacting with t...
Hybrid systems are used to model embedded computing systems interacting with their physical environm...
Physical systems can be naturally modeled by combining continuous and discrete models. Such hybrid m...
Physical systems can be naturally modeled by combining continuous and discrete models. Such hybrid m...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
Hybrid modelers such as SIMULINK have become corner stones of embedded systems development. They all...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
Hybrid modelers such as SIMULINK have become corner stones of embedded systems development. They all...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The hybrid ¿ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. I...
The use of formal methods, techniques and tools may generally guarantee a systems ’ safe operation. ...
Formal analysis of Simulink/Stateflow (SLSF) diagrams requires association of semantics to these dia...
Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical...