Dependability checking with StoCharts: Is train radio reliable enough for trains?

Performance, dependability and quality of service (QoS) are prime aspects of the UML modelling domain. To capture these aspects effectively in the design phase, we have recently proposed STOCHARTS, a conservative extension of UML statechart diagrams. In this paper, we apply the STOCHART formalism to a safety critical design problem. We model a part of the European Train Control System specification, focusing on the risks of wireless communication failures in future high-speed cross-European trains. Stochastic model checking with the model checker PROVER enables us to derive constraints under which the central quality requirements are satisfied by the STOCHART model. The paper illustrates the flexibility and maturity of STOCHARTS to model real problems in safety critical system design

Process algebra for performance evaluation

This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems – like large-scale computers, client–server architectures, networks – can accurately be described using such stochastic specification formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for different types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple actionless algebra for describing time-homogeneous continuous-time Markov chains, we consider the integration of actions and random delays both as a single entity (like in known Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). In total we consider four related calculi and investigate their relationship to existing Markovian process algebras. We also briefly indicate how one can profit from the separation of time and actions when incorporating more general, non-Markovian distributions

Scale-invariant cellular automata and self-similar Petri nets

Two novel computing models based on an infinite tessellation of space-time are introduced. They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the second one utilizes self-similar Petri nets. Both models are capable of hypercomputations and can, for instance, "solve" the halting problem for Turing machines. These two models are closely related, as they exhibit a step-by-step equivalence for finite computations. On the other hand, they differ greatly for computations that involve an infinite number of building blocks: the first one shows indeterministic behavior whereas the second one halts. Both models are capable of challenging our understanding of computability, causality, and space-time.Comment: 35 pages, 5 figure

Stochastic Learning Feedback Hybrid Automata for Dynamic Power Management in Embedded Systems

Dynamic power management (DPM) refers to the strategies employed at system level to reduce energy expenditure (i.e. to prolong battery life) in embedded systems. The trade-off involved in DPM techniques is between the reductions of energy consumption and latency suffered by the tasks. Such trade-offs need to be decided at runtime, making DPM an on-line problem. We formulate DPM as a hybrid automaton control problem and integrate stochastic control. The control strategy is learnt dynamically using stochastic learning hybrid automata (SLHA) with feedback learning algorithms. Simulation-based experiments show the expediency of the feedback systems in stationary environments. Further experiments reveal that SLHA attains better trade-offs than several former predictive algorithms under certain trace data

Mastering operational limitations of LEO satellites – The GOMX-3 approach

When working with space systems the keyword is resources. For a satellite in orbit all resources are sparse and the most critical resource of all is power. It is therefore crucial to have detailed knowledge on how much power is available for an energy harvesting satellite in orbit at every time – especially when in eclipse, where it draws its power from onboard batteries. This paper addresses this problem by a two-step procedure to perform task scheduling for low-earth-orbit (LEO) satellites exploiting formal methods. It combines cost-optimal reachability analyses of priced timed automata networks with a realistic kinetic battery model capable of capturing capacity limits as well as stochastic fluctuations. The procedure is in use for the automatic and resource-optimal day-ahead scheduling of GOMX-3, a power-hungry nanosatellite currently orbiting the earth. We explain how this approach has overcome existing problems, has led to improved designs, and has provided new insights

Application and Control Aware Communication Strategies for Transportation and Energy Cyber-Physical Systems

Cyber--Physical Systems (CPSs) are a generation of engineered systems in which computing, communication, and control components are tightly integrated. Some important application domains of CPS are transportation, energy, and medical systems. The dynamics of CPSs are complex, involving the stochastic nature of communication systems, discrete dynamics of computing systems, and continuous dynamics of control systems. The existence of communication between and among controllers of physical processes is one of the basic characteristics of CPSs. Under this situation, some fundamental questions are: 1) How does the network behavior (communication delay, packet loss, etc.) affect the stability of the system? 2) Under what conditions is a complex system stabilizable?;In cases where communication is a component of a control system, scalability of the system becomes a concern. Therefore, one of the first issues to consider is how information about a physical process should be communicated. For example, the timing for sampling and communication is one issue. The traditional approach is to sample the physical process periodically or at predetermined times. An alternative is to sample it when specific events occur. Event-based sampling requires continuous monitoring of the system to decide a sample needs to be communicated. The main contributions of this dissertation in energy cyber-physical system domain are designing and modeling of event-based (on-demand) communication mechanisms. We show that in the problem of tracking a dynamical system over a network, if message generation and communication have correlation with estimation error, the same performance as the periodic sampling and communication method can be reached using a significantly lower rate of data.;For more complex CPSs such as vehicle safety systems, additional considerations for the communication component are needed. Communication strategies that enable robust situational awareness are critical for the design of CPSs, in particular for transportation systems. In this dissertation, we utilize the recently introduced concept of model-based communication and propose a new communication strategy to address this need. Our approach to model behavior of remote vehicles mathematically is to describe the small-scale structure of the remote vehicle movement (e.g. braking, accelerating) by a set of dynamic models and represent the large-scale structure (e.g. free following, turning) by coupling these dynamic models together into a Markov chain. Assuming model-based communication approach, a novel stochastic model predictive method is proposed to achieve cruise control goals and investigate the effect of new methodology.;To evaluate the accuracy and robustness of a situational awareness methodology, it is essential to study the mutual effect of the components of a situational awareness subsystem, and their impact on the accuracy of situational awareness. The main components are estimation and networking processes. One possible approach in this task is to produce models that provide a clear view into the dynamics of these two components. These models should integrate continuous physical dynamics, expressed with ordinary differential equations, with the discrete behaviors of communication, expressed with finite automata or Markov chain. In this dissertation, a hybrid automata model is proposed to combine and model both networking and estimation components in a single framework and investigate their interactions.;In summary, contributions of this dissertation lie in designing and evaluating methods that utilize knowledge of the physical element of CPSs to optimize the behavior of communication subsystems. Employment of such methods yields significant overall system performance improvement without incurring additional communication deployment costs

Choice and chance:model-based testing of stochastic behaviour

Probability plays an important role in many computer applications. A vast number of algorithms, protocols and computation methods uses randomisation to achieve their goals. A crucial question then becomes whether such probabilistic systems work as intended. To investigate this, such systems are often subjected to a large number of well-designed test cases, that compare a observed behaviour to a requirements specification. Model-based testing is an innovative testing technique rooted in formal methods, that aims at automating this labour intense and often error-prone manual task. By providing faster and more thorough testing at lower cost, it has gained rapid popularity in industry and academia alike. However, classic model-based testing methods are insufficient when dealing with inherently stochastic systems. This thesis introduces a rigorous model-based testing framework, that is capable to automatically test such systems. The presented methods are capable of judging functional correctness, discrete probability choices, and hard and soft-real time constraints. The framework is constructed in a clear step-by-step approach. First, the model-based testing landscape is laid out, and related work is discussed. Next, we instantiate a model-based testing framework to highlight the purpose of individual theoretical components like, e.g., a conformance relation, test cases, and practical test generation algorithms. This framework is then conservatively extended by introducing discrete probability choices to the specification language. A last step further extends this probabilistic framework by adding hard and soft real time constraints. Classical functional correctness verdicts are thus extended with goodness of fit methods known from statistics. Proofs of the framework’s correctness are presented before its capabilities are exemplified by studying smaller scale case studies known from the literature. The framework reconciles non-deterministic and probabilistic choices in a fully-fledged way via the use of schedulers. Schedulers then become a subject worthy to study in their own rights. This is done in the second part of this thesis; we introduce a most natural equivalence relation based on schedulers for Markov automata, and compare its distinguishing power to notions of trace distributions and bisimulation relations. Lastly, the power of different scheduler classes of stochastic automata is investigated. We compare reachability probabilities of different schedulers by altering the information available to them. A hierarchy of scheduler classes is established, with the intent to reduce complexity of related problems by gaining near optimal results for smaller scheduler classes