9,260 research outputs found
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
Design and Development of Software Tools for Bio-PEPA
This paper surveys the design of software tools for the Bio-PEPA process algebra. Bio-PEPA is a high-level language for modelling biological systems such as metabolic pathways and other biochemical reaction networks. Through providing tools for this modelling language we hope to allow easier use of a range of simulators and model-checkers thereby freeing the modeller from the responsibility of developing a custom simulator for the problem of interest. Further, by providing mappings to a range of different analysis tools the Bio-PEPA language allows modellers to compare analysis results which have been computed using independent numerical analysers, which enhances the reliability and robustness of the results computed.
Rate-Based Transition Systems for Stochastic Process Calculi
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for providing the operational semantics of stochastic extensions of classical formalisms, namely CSP and CCS. We also show that our semantics for stochastic CCS guarantees associativity of parallel composition. Similarly, in contrast with the original definition by Priami, we argue that a semantics for stochastic π-calculus can be provided that guarantees associativity of parallel composition
Isomorphism Checking for Symmetry Reduction
In this paper, we show how isomorphism checking can be used as an effective technique for symmetry reduction. Reduced state spaces are equivalent to the original ones under a strong notion of bisimilarity which preserves the multiplicity of outgoing transitions, and therefore also preserves stochastic temporal logics. We have implemented this in a setting where states are arbitrary graphs. Since no efficiently computable canonical representation is known for arbitrary graphs modulo isomorphism, we define an isomorphism-predicting hash function on the basis of an existing partition refinement algorithm. As an example, we report a factorial state space reduction on a model of an ad-hoc network connectivity protocol
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
2.5 player parity games combine the challenges posed by 2.5 player
reachability games and the qualitative analysis of parity games. These two
types of problems are best approached with different types of algorithms:
strategy improvement algorithms for 2.5 player reachability games and recursive
algorithms for the qualitative analysis of parity games. We present a method
that - in contrast to existing techniques - tackles both aspects with the best
suited approach and works exclusively on the 2.5 player game itself. The
resulting technique is powerful enough to handle games with several million
states
Stochastic Collapse and Decoherence of a Non-Dissipative Forced Harmonic Oscillator
Careful monitoring of harmonically bound (or as a limiting case, free) masses
is the basis of current and future gravitational wave detectors, and of
nanomechanical devices designed to access the quantum regime. We analyze the
effects of stochastic localization models for state vector reduction, and of
related models for environmental decoherence, on such systems, focusing our
analysis on the non-dissipative forced harmonic oscillator, and its free mass
limit. We derive an explicit formula for the time evolution of the expectation
of a general operator in the presence of stochastic reduction or
environmentally induced decoherence, for both the non-dissipative harmonic
oscillator and the free mass. In the case of the oscillator, we also give a
formula for the time evolution of the matrix element of the stochastic
expectation density matrix between general coherent states. We show that the
stochastic expectation of the variance of a Hermitian operator in any
unraveling of the stochastic process is bounded by the variance computed from
the stochastic expectation of the density matrix, and we develop a formal
perturbation theory for calculating expectation values of operators within any
unraveling. Applying our results to current gravitational wave interferometer
detectors and nanomechanical systems, we conclude that the deviations from
quantum mechanics predicted by the continuous spontaneous localization (CSL)
model of state vector reduction are at least five orders of magnitude below the
relevant standard quantum limits for these experiments. The proposed LISA
gravitational wave detector will be two orders of magnitude away from the
capability of observing an effect.Comment: TeX; 34 page
Stochastic Modeling and Performance Analysis of Multimedia SoCs
International audienceQuality of video and audio output is a design-time constraint for portable multimedia devices. Unfortunately, there is a huge cost (e.g. buffer size) incurred to deterministically guarantee good playout quality; the worst-case workload and the timing behavior can be significantly larger than the average-case due to high variability in a multimedia system. In future mobile devices, the playout buffer size is expected to increase, so, buffer dimensioning will remain as an important problem in system design. We propose a probabilistic analytical framework that enables low-cost system design and provides bounds for playing acceptable multimedia quality. We compare our approach with a framework comprising both simulation and statistical model checking, built to simulate large embedded systems in detail. Our results show significant reduction in output buffer size compared to deterministic frameworks
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
- …