2,971 research outputs found
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
A Process Calculus for Dynamic Networks
In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards
the verification of a leader-election algorithm for mobile ad hoc networks
Discrete Simulation of Behavioural Hybrid Process Calculus
Hybrid systems combine continuous-time and discrete behaviours. Simulation is one of the tools to obtain insight in dynamical systems behaviour. Simulation results provide information on performance of system and are helpful in detecting potential weaknesses and errors. Moreover, the results are handy in choosing adequate control strategies and parameters. In our contribution we report a work in progress, a technique for simulation of Behavioural Hybrid Process Calculus, an extension of process algebra that is suitable for the modelling and analysis of hybrid systems
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions
Several Markovian process calculi have been proposed in the literature, which
differ from each other for various aspects. With regard to the action
representation, we distinguish between integrated-time Markovian process
calculi, in which every action has an exponentially distributed duration
associated with it, and orthogonal-time Markovian process calculi, in which
action execution is separated from time passing. Similar to deterministically
timed process calculi, we show that these two options are not irreconcilable by
exhibiting three mappings from an integrated-time Markovian process calculus to
an orthogonal-time Markovian process calculus that preserve the behavioral
equivalence of process terms under different interpretations of action
execution: eagerness, laziness, and maximal progress. The mappings are limited
to classes of process terms of the integrated-time Markovian process calculus
with restrictions on parallel composition and do not involve the full
capability of the orthogonal-time Markovian process calculus of expressing
nondeterministic choices, thus elucidating the only two important differences
between the two calculi: their synchronization disciplines and their ways of
solving choices
A Process Calculus for Molecular Interaction Maps
We present the MIM calculus, a modeling formalism with a strong biological
basis, which provides biologically-meaningful operators for representing the
interaction capabilities of molecular species. The operators of the calculus
are inspired by the reaction symbols used in Molecular Interaction Maps (MIMs),
a diagrammatic notation used by biologists. Models of the calculus can be
easily derived from MIM diagrams, for which an unambiguous and executable
interpretation is thus obtained. We give a formal definition of the syntax and
semantics of the MIM calculus, and we study properties of the formalism. A case
study is also presented to show the use of the calculus for modeling
biomolecular networks.Comment: 15 pages; 8 figures; To be published on EPTCS, proceedings of MeCBIC
200
A Process Calculus for Spatially-explicit Ecological Models
We propose PALPS, a Process Algebra with Locations for Population Systems.
PALPS allows us to produce spatially-explicit, individual-based models and to
reason about their behavior. Our calculus has two levels: at the first level we
may define the behavior of an individual of a population while, at the second
level, we may specify a system as the collection of individuals of various
species located in space, moving through their life cycle while changing their
location, if they so wish, and interacting with each other in various ways such
as preying on each other. Furthermore, we propose a probabilistic temporal
logic for reasoning about the behavior of PALPS processes. We illustrate our
framework via models of dispersal in metapopulations.Comment: In Proceedings MeCBIC 2012, arXiv:1211.347
Verification of Linear Optical Quantum Computing using Quantum Process Calculus
We explain the use of quantum process calculus to describe and analyse linear
optical quantum computing (LOQC). The main idea is to define two processes, one
modelling a linear optical system and the other expressing a specification, and
prove that they are behaviourally equivalent. We extend the theory of
behavioural equivalence in the process calculus Communicating Quantum Processes
(CQP) to include multiple particles (namely photons) as information carriers,
described by Fock states or number states. We summarise the theory in this
paper, including the crucial result that equivalence is a congruence, meaning
that it is preserved by embedding in any context. In previous work, we have
used quantum process calculus to model LOQC but without verifying models
against specifications. In this paper, for the first time, we are able to carry
out verification. We illustrate this approach by describing and verifying two
models of an LOQC CNOT gate.Comment: In Proceedings EXPRESS/SOS 2014, arXiv:1408.127
- …