A compositional modelling and analysis framework for stochastic hybrid systems

The theory of hybrid systems is well-established as a model for real-world systems consisting of continuous behaviour and discrete control. In practice, the behaviour of such systems is also subject to uncertainties, such as measurement errors, or is controlled by randomised algorithms. These aspects can be modelled and analysed using stochastic hybrid systems. In this paper, we present HModest, an extension to the Modest modelling language—which is originally designed for stochastic timed systems without complex continuous aspects—that adds differential equations and inclusions as an expressive way to describe the continuous system evolution. Modest is a high-level language inspired by classical process algebras, thus compositional modelling is an integral feature. We define the syntax and semantics of HModest and show that it is a conservative extension of Modest that retains the compositional modelling approach. To allow the analysis of HModest models, we report on the implementation of a connection to recently developed tools for the safety verification of stochastic hybrid systems, and illustrate the language and the tool support with a set of small, but instructive case studies.     

Modelling and temporal performances evaluation of networked control systems using (max, +) algebra

In this paper, we address the problem of temporal performances evaluation of producer/consumer networked control systems. The aim is to develop a formal method for evaluating the response time of this type of control systems. Our approach consists on modelling, using Petri nets classes, the behaviour of the whole architecture including the switches that support multicast communications used by this protocol. (max, +) algebra formalism is then exploited to obtain analytical formulas of the response time and the maximal and minimal bounds. The main novelty is that our approach takes into account all delays experienced at the different stages of networked automation systems. Finally, we show how to apply the obtained results through an example of networked control system.     

Simulation of wildfire evacuation with dynamic factors and model composition

Wildfires cause devastation on communities, most significantly loss of life. The safety of at-risk populations depends on accurate risk assessment and emergency planning. Evacuation modelling and simulation systems are essential tools for such planning and decision making. During a wildfire evacuation, the behaviour of people is a key factor; what people do, and when they do it, depends heavily on the spatio-temporal distribution of events in a scenario. In this paper, we introduce an approach that enables the behaviour of people and the timing of events to be explicitly modelled through what we term dynamic factors. Our approach composes several simulation and modelling systems, including a wildfire simulator, behaviour modeller, and microscopic traffic simulator, to compute detailed projections of how scenarios unfold. The level of detail provided by our modelling approach enables the definition of a new risk metric, the exposure count, which directly quantifies the threat to a population. Experiments for a wildfire-prone region in Victoria, Australia, resulted in statistically significant differences in clearance times and exposure counts when comparing our modelling approach to an approach that does not account for dynamic factors. The approach has been implemented in a high performance and scalable system – the architecture of which is discussed – that allows multiple concurrent scenarios to be simulated in timeframes suitable for both planning and response use cases.     

Formalising the Hybrid ERTMS Level 3 specification in iUML-B and Event-B

We demonstrate refinement-based formal development of the hybrid, ‘fixed virtual block’ approach to train movement control for the emerging European Rail Traffic Management System (ERTMS) level 3. Our approach uses iUML-B diagrams as a front end to the Event-B modelling language. We use abstraction to verify the principle of movement authority before gradually developing the details of the Virtual Block Detector component in subsequent refinements, thus verifying that it preserves the safety properties. We animate the refined models to demonstrate their validity using the scenarios from the Hybrid ERTMS Level 3 (HLIII) specification. We reflect on our team-based approach to finding useful modelling abstractions and demonstrate a systematic modelling method based on the state and class diagrams of iUML-B. The component and control flow architectures of the application, its environment and interacting systems emerge through the layered refinement process. The runtime semantics of the specification’s state-machine behaviour are modelled in the final refinements. We discuss how the model could be used to generate an implementation using code generation tools and techniques.

     

Constructing NARMAX models using ARMAX models

This paper outlines how it is possible to decompose a complex non-linear modelling problem into a set of simpler linear modelling problems. Local ARMAX models valid within certain operating regimes are interpolated to construct a global NARMAX (non-linear NARMAX) model. Knowledge of the system behaviour in terms of operating regimes is the primary basis for building such models, hence it should not be considered as a pure black-box approach, but as an approach that utilizes a limited amount of a priori system knowledge. It is shown that a large class of non-linear systems can be modelled in this way, and indicated how to decompose the systems range of operation into operating regimes. Standard system identification algorithms can be used to identify the NARMAX model, and several aspects of the system identification problem are discussed and illustrated by a simulation example.     

An algebra of hybrid systems

Hybrid systems are heterogeneous systems characterised by the interaction of discrete and continuous dynamics. We present a trajectory-based algebraic model for describing hybrid systems; the trajectories used are closely related to streams. The algebra is based on left quantales and left semirings and provides a new application for these algebraic structures. We show that hybrid automata, which are probably the standard tool for describing hybrid systems, can conveniently be embedded into our algebra. Moreover we point out some important advantages of the algebraic approach. In particular, we show how to handle Zeno effects, which are excluded by most other authors. The development of the theory is illustrated by a running example and a larger case study.     

State space analysis of Petri nets with relation-algebraic methods

A large variety of systems can be modelled by Petri nets. Their formal semantics are based on linear algebra which in particular allows the calculation of a Petri net’s state space. Since state space explosion is still a serious problem, efficiently calculating, representing, and analysing the state space is mandatory. We propose a formal semantics of Petri nets based on executable relation-algebraic specifications. Thereupon, we suggest how to calculate the markings reachable from a given one simultaneously. We provide an efficient representation of reachability graphs and show in a correct-by-construction approach how to efficiently analyse their properties. Therewith we cover two aspects: modelling and model checking systems by means of one and the same logic-based approach. On a practical side, we explore the power and limits of relation-algebraic concepts for concurrent system analysis.     

Timed Discrete Event Control of Parallel Production Lines with Continuous Outputs

In this contribution we present an approach to formulate and solve certain scheduling tasks for hybrid systems using timed discrete event control methods. To demonstrate our approach, we consider a cyclically operated plant with parallel reactors using common resources and a continuous output. For this class of systems, we show how to pose the control problem within a discrete event framework by modelling system components as multirate timed automata. We propose a supervisory control strategy incorporating off-line optimisation to assure safety and nonconflicting use of resources. These properties have to be achieved in the presence of a class of bounded errors/disturbances and can be verified by applying formal methods.     

Performance evaluation of nonlinear weighted T-system

This article deals with the analysis of discrete event systems which can be modelled by timed event graphs with multipliers (TEGMs). These graphs are an extension of weighted T-systems studied in the Petri net literature. These models do not admit a linear representation in (min,?+) algebra. This nonlinearity is due to the presence of weights on arcs. To mitigate this problem of nonlinearity and to apply some basic results used to analyse the performances of linear systems in dioid algebra, we propose a linearisation method of mathematical model reflecting the behaviour of a TEGM in order to obtain a (min,?+) linear model.