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

Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages

Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they constitute a convenient modeling instrument to deal with stochastic process languages. In this paper, the notion of bisimulation induced by a FuTS is proposed and a correspondence result is proven stating that FuTS-bisimulation coincides with the behavioral equivalence of the associated functor. As generic examples, the concrete existing equivalences for the core of the process algebras ACP, PEPA and IMC are related to the bisimulation of specific FuTS, providing via the correspondence result coalgebraic justification of the equivalences of these calculi.Comment: In Proceedings ACCAT 2012, arXiv:1208.430

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

Distributed Synthesis in Continuous Time

We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states is reached, or reached with at least a given probability. The flow of time is modelled explicitly based on continuous-time randomness, with two natural implications: First, the non-determinism stemming from interleaving disappears. Second, when we restrict to a subclass of non-urgent models, the quantitative value problem for two players can be solved in EXPTIME. Indeed, the explicit continuous time enables players to communicate their states by delaying synchronisation (which is unrestricted for non-urgent models). In general, the problems are undecidable already for two players in the quantitative case and three players in the qualitative case. The qualitative undecidability is shown by a reduction to decentralized POMDPs for which we provide the strongest (and rather surprising) undecidability result so far

Probabilistic CTL* : the deductive way

Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics. Model checking methods are not directly applicable to infinite-state systems, and techniques for infinite-state probabilistic systems are limited in terms of the specifications they can handle. This paper presents a deductive approach to the verification of countable-state systems against properties specified in probabilistic CTL ∗ , on models featuring both nondeterministic and probabilistic choices. The deductive proof system we propose lifts the classical proof system by Kesten and Pnueli to the probabilistic setting. However, the soundness arguments are completely distinct and go via the theory of martingales. Completeness results for the finite-state case and an infinite-state example illustrate the effectiveness of our approach

Quantum Hall quasielectron operators in conformal field theory

In the conformal field theory (CFT) approach to the quantum Hall effect, the multi-electron wave functions are expressed as correlation functions in certain rational CFTs. While this approach has led to a well-understood description of the fractionally charged quasihole excitations, the quasielectrons have turned out to be much harder to handle. In particular, forming quasielectron states requires non-local operators, in sharp contrast to quasiholes that can be created by local chiral vertex operators. In both cases, the operators are strongly constrained by general requirements of symmetry, braiding and fusion. Here we construct a quasielectron operator satisfying these demands and show that it reproduces known good quasiparticle wave functions, as well as predicts new ones. In particular we propose explicit wave functions for quasielectron excitations of the Moore-Read Pfaffian state. Further, this operator allows us to explicitly express the composite fermion wave functions in the positive Jain series in hierarchical form, thus settling a longtime controversy. We also critically discuss the status of the fractional statistics of quasiparticles in the Abelian hierarchical quantum Hall states, and argue that our construction of localized quasielectron states sheds new light on their statistics. At the technical level we introduce a generalized normal ordering, that allows us to "fuse" an electron operator with the inverse of an hole operator, and also an alternative approach to the background charge needed to neutralize CFT correlators. As a result we get a fully holomorphic CFT representation of a large set of quantum Hall wave functions.Comment: minor changes, publishe

Hierarchy wave functions--from conformal correlators to Tao-Thouless states

Laughlin's wave functions, describing the fractional quantum Hall effect at filling factors $\nu=1/(2k+1)$, can be obtained as correlation functions in conformal field theory, and recently this construction was extended to Jain's composite fermion wave functions at filling factors $\nu=n/(2kn+1)$. Here we generalize this latter construction and present ground state wave functions for all quantum Hall hierarchy states that are obtained by successive condensation of quasielectrons (as opposed to quasiholes) in the original hierarchy construction. By considering these wave functions on a cylinder, we show that they approach the exact ground states, the Tao-Thouless states, when the cylinder becomes thin. We also present wave functions for the multi-hole states, make the connection to Wen's general classification of abelian quantum Hall fluids, and discuss whether the fractional statistics of the quasiparticles can be analytically determined. Finally we discuss to what extent our wave functions can be described in the language of composite fermions.Comment: 9 page