1,926 research outputs found
Abstractions of Stochastic Hybrid Systems
In this paper we define a stochastic bisimulation concept for a very general class of stochastic hybrid systems, which subsumes most classes of stochastic hybrid systems. The definition of this bisimulation builds on the concept of zigzag morphism defined for strong Markov processes.
The main result is that this stochastic bisimulation is indeed an equivalence relation. The secondary result is that this bisimulation relation for the stochastic hybrid system models used in this paper implies the same
kind of bisimulation for their continuous parts and respectively for their jumping structures
Bisimulation for quantum processes
In this paper we introduce a novel notion of probabilistic bisimulation for
quantum processes and prove that it is congruent with respect to various
process algebra combinators including parallel composition even when both
classical and quantum communications are present. We also establish some basic
algebraic laws for this bisimulation. In particular, we prove uniqueness of the
solutions to recursive equations of quantum processes, which provides a
powerful proof technique for verifying complex quantum protocols.Comment: Journal versio
Behavioural hybrid process calculus
Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concurrent discrete event systems that has been developed within computer science in past quarter century. It has generated a deeper nderstanding of the nature of concepts such as observable behaviour in the presence of nondeterminism, system composition by interconnection of concurrent component systems, and notions of behavioural equivalence of such systems. It has contributed fundamental concepts such as bisimulation, and has been successfully used in a wide range of problems and practical applications in concurrent systems. We believe that the basic tenets of process algebra are highly compatible with the behavioural approach to dynamical systems. In our contribution we present an extension of classical process algebra that is suitable for the modelling and analysis of continuous and hybrid dynamical systems. It provides a natural framework for the concurrent composition of such systems, and can deal with nondeterministic behaviour that may arise from the occurrence of internal switching events. Standard process algebraic techniques lead to the characterisation of the observable behaviour of such systems as equivalence classes under some suitably adapted notion of bisimulation
Bisimulation, Logic and Reachability Analysis for Markovian Systems
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verification is called stochastic reachability analysis, while in computer science this is called probabilistic model checking
(PMC). In the context of this work, we consider the two terms interchangeable. It is worthy to note that PMC has been mostly considered for discrete systems. Therefore, there is an issue of improving the application of computer science techniques in the formal verification of continuous stochastic systems.
We present a new probabilistic logic of model theoretic nature. The terms of this logic express reachability properties and the logic formulas express statistical properties of terms.
Moreover, we show that this logic characterizes a bisimulation relation for continuous time continuous space Markov processes. For this logic we define a new semantics using state space symmetries. This is a recent concept that was successfully used in model checking. Using this semantics, we prove a full abstraction result. Furthermore, we prove a result that can be used in model checking, namely that the bisimulation preserves the probabilities of the reachable sets
A Logic with Reverse Modalities for History-preserving Bisimulations
We introduce event identifier logic (EIL) which extends Hennessy-Milner logic
by the addition of (1) reverse as well as forward modalities, and (2)
identifiers to keep track of events. We show that this logic corresponds to
hereditary history-preserving (HH) bisimulation equivalence within a particular
true-concurrency model, namely stable configuration structures. We furthermore
show how natural sublogics of EIL correspond to coarser equivalences. In
particular we provide logical characterisations of weak history-preserving (WH)
and history-preserving (H) bisimulation. Logics corresponding to HH and H
bisimulation have been given previously, but not to WH bisimulation (when
autoconcurrency is allowed), as far as we are aware. We also present
characteristic formulas which characterise individual structures with respect
to history-preserving equivalences.Comment: In Proceedings EXPRESS 2011, arXiv:1108.407
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
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
The standard operational semantics of the sequential composition operator
gives rise to unbounded branching and forgetfulness when transparent process
expressions are put in sequence. Due to transparency, the correspondence
between context-free and pushdown processes fails modulo bisimilarity, and it
is not clear how to specify an always terminating half counter. We propose a
revised operational semantics for the sequential composition operator in the
context of intermediate termination. With the revised operational semantics, we
eliminate transparency, allowing us to establish a close correspondence between
context-free processes and pushdown processes. Moreover, we prove the reactive
Turing powerfulness of TCP with iteration and nesting with the revised
operational semantics for sequential composition.Comment: In Proceedings EXPRESS/SOS 2017, arXiv:1709.00049. arXiv admin note:
substantial text overlap with arXiv:1706.0840
- …