Event-B Hybridation

2021 ◽  
Vol 20 (4) ◽  
pp. 1-37
Author(s):  
Guillaume Dupont ◽  
Yamine Ait-Ameur ◽  
Neeraj Kumar Singh ◽  
Marc Pantel

Hybrid systems are complex systems where a software controller interacts with a physical environment, usually named a plant, through sensors and actuators. The specification and design of such systems usually rely on the description of both continuous and discrete behaviours. From complex embedded systems to autonomous vehicles, these systems became quite common, including in safety critical domains. However, their formal verification and validation as a whole is still a challenge. To address this challenge, this article contributes to the definition of a reusable and tool supported formal framework handling the design and verification of hybrid system models that integrate both discrete (the controller part) and continuous (the plant part) behaviours. This framework includes the development of a process for defining a class of basic theories and developing domain theories and then the use of these theories to develop a generic model and system-specific models. To realise this framework, we present a formal proof tool chain, based on the Event-B correct-by-construction method and its integrated development environment Rodin, to develop a set of theories, a generic model, proof processes, and the required properties for designing hybrid systems in Event-B. Our approach relies on hybrid automata as basic models for such systems. Discrete and continuous variables model system states and behaviours are given using discrete state changes and continuous evolution following a differential equation. The proposed approach is based on refinement and proof using the Event-B method and the Rodin toolset. Two case studies borrowed from the literature are used to illustrate our approach. An assessment of the proposed approach is provided for evaluating its extensibility, effectiveness, scalability, and usability.

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Antonio Favela-Contreras ◽  
Francisco Beltrán-Carbajal ◽  
Alejandro Piñón ◽  
Angelo Raimondi

Hybrid systems are those that inherently combine discrete and continuous dynamics. This paper considers the hybrid system model to be an extension of the discrete automata associating a continuous evolution with each discrete state. This model is called the hybrid automaton. In this work, we achieve a mathematical formulation of the steady state and we show a way to obtain the initial conditions region to reach a specific limit cycle for a class of uncoupled and coupled continuous-linear hybrid systems. The continuous-linear term is used in the sense of the system theory and, in this sense, continuous-linear hybrid automata will be defined. Thus, some properties and theorems that govern the hybrid automata dynamic behavior to evaluate a limit cycle existence have been established; this content is explained under a theoretical framework.


2012 ◽  
Vol 77 (10-11) ◽  
pp. 1122-1150 ◽  
Author(s):  
Werner Damm ◽  
Henning Dierks ◽  
Stefan Disch ◽  
Willem Hagemann ◽  
Florian Pigorsch ◽  
...  

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Paul Kröger ◽  
Martin Fränzle

Abstract Hybrid system dynamics arises when discrete actions meet continuous behaviour due to physical processes and continuous control. A natural domain of such systems are emerging smart technologies which add elements of intelligence, co-operation, and adaptivity to physical entities. Various flavours of hybrid automata have been suggested as a means to formally analyse dynamics of such systems. In this article, we present our current work on a revised formal model that is able to represent state tracking and estimation in hybrid systems and thereby enhancing precision of verification verdicts.


2019 ◽  
Vol 6 (2) ◽  
pp. 83-90
Author(s):  
Koteswara Rao Ballamudi

Hybrid automata strategies have advanced as a vital tool to design, check and direct the execution of hybrid systems. Any way they can – and we assume should – be utilized to communicate quantitative models about hybrid systems in different areas, for example, experimental sciences. Since the conventional design of hybrid automata compares well to consecutively integrate behavioral chains in living creatures, we look for a use of hybrid modeling procedures in the social sciences and, particularly, brain research. We attempt to address the question related to how human drivers move onto an expressway and simultaneously utilize this study as our test-bed for utilizing hybrid automata inside behavioral sciences. Hybrid automata give a language to displaying and exploring advanced and simple calculations in real-time systems. Hybrid automata are studied here from a dynamical systems point of view. Essential and adequate conditions for the presence and uniqueness of arrangements are inferred and a class of hybrid automata whose arrangements rely consistently upon the underlying state is described. The outcomes on presence, uniqueness, and progression fill in as a beginning stage for solid study. In this paper, we present the structure of hybrid automata as a model and detailed language for hybrid systems. Hybrid automata can be seen as a theory of timed automata, in which the behavior of factors is represented in each state by a bunch of differential conditions. We show that a large number of the models considered in the workshop can be characterized by hybrid automata. While the reachability issue is undecidable in any event, for extremely confined classes of hybrid automata, we present two semi-decision techniques for checking security properties of piecewise-straight hybrid automata, in which all factors change at steady rates. The two techniques are based, individually, on limiting and figuring fix points on for the most part endless state spaces. We show that if the end of the method, at that point they offer the right responses. We then show that for a significant number of the run of the mill workshop models, the strategies do end and hence give an algorithmic approach to confirming their properties.


10.29007/23pm ◽  
2018 ◽  
Author(s):  
Luan Viet Nguyen ◽  
Taylor T Johnson

Power electronics represent a large and important class of hybrid systems, as modern digital computers and many other systems rely on their correct operation. In this benchmark description, we model three DC-to-DC switched-mode power converters as hybrid automata with continuous dynamics specified by linear ordinary differential equations. A DC-to-DC converter transforms a DC source voltage from one voltage level to another utilizing switches toggled at some (typically kilohertz) frequency with some duty cycle. The state of this switch gives rise to the locations of the hybrid automaton, and the continuous variables are currents and voltages. The main contributions of this benchmark description include: (a) unified modeling of three types of converters as a hybrid automaton with two locations and differing continuous dynamics, and (b) a basic benchmark generator that allows for simulation of these converters in Simulink/Stateflow and reachability analysis in SpaceEx. Future challenges for these benchmark classes include closed-loop control, where the speeds of plant and controller dynamics differ by orders of magnitude.


Author(s):  
Madara Ogot ◽  
Sherif Aly

Global optimization of mechanical design problems using heuristic methods such as Simulated annealing (SA) and genetic algorithms (GAs) have been able to find global or near-global minima where prior methods have failed. The use of these nongradient based methods allow the broad efficient exploration of multimodal design spaces that could be continuous, discrete or mixed. From a survey of articles in the ASME Journal of Mechanical Design over the last 10 years, we have observed that researchers will typically run these algorithms in continuous mode for problems that contain continuous design variables. What we suggest in this paper is that computational efficiencies can be significantly increased by discretizing all continuous variables, perform a global optimization on the discretized design space, and then conduct a local search in the continuous space from the global minimum discrete state. The level of discretization will depend on the complexity of the problem, and becomes an additional parameter that needs to be tuned. The rational behind this assertion is presented, along with results from four test problems.


Sign in / Sign up

Export Citation Format

Share Document