Compositional Performance Modelling with the TIPPtool

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations

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

Partial Perception and Approximate Understanding

What is discussed in the present paper is the assumption concerning a human narrowed sense of perception of external world and, resulting from this, a basically approximate nature of concepts that are to portray it. Apart from the perceptual vagueness, other types of vagueness are also discussed, involving both the nature of things, indeterminacy of linguistic expressions and psycho-sociological conditioning of discourse actions in one language and in translational contexts. The second part of the paper discusses the concept of conceptual and linguistic resemblance (similarity, equivalence) and discourse approximating strategies and proposes a Resemblance Matrix, presenting ways used to narrow the approximation gap between the interacting parties in monolingual and translational discourses

Implementation of classical communication in a quantum world

Observations of quantum systems carried out by finite observers who subsequently communicate their results using classical data structures can be described as "local operations, classical communication" (LOCC) observations. The implementation of LOCC observations by the Hamiltonian dynamics prescribed by minimal quantum mechanics is investigated. It is shown that LOCC observations cannot be described using decoherence considerations alone, but rather require the \textit{a priori} stipulation of a positive operator-valued measure (POVM) about which communicating observers agree. It is also shown that the transfer of classical information from system to observer can be described in terms of system-observer entanglement, raising the possibility that an apparatus implementing an appropriate POVM can reveal the entangled system-observer states that implement LOCC observations.Comment: 17 pages, 2 figures; final versio

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi

Labeled transition systems are typically used to represent the behavior of nondeterministic processes, with labeled transitions defining a one-step state to-state reachability relation. This model has been recently made more general by modifying the transition relation in such a way that it associates with any source state and transition label a reachability distribution, i.e., a function mapping each possible target state to a value of some domain that expresses the degree of one-step reachability of that target state. In this extended abstract, we show how the resulting model, called ULTraS from Uniform Labeled Transition System, can be naturally used to give semantics to a fully nondeterministic, a fully probabilistic, and a fully stochastic variant of a CSP-like process language.Comment: In Proceedings PACO 2011, arXiv:1108.145