Results 1  10
of
19
Making random choices invisible to the scheduler
 In Proc. of CONCUR’07). To appear
, 2007
"... Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler ne ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler needs to be restricted so not to reveal the outcome of the protocol’s random choices, or otherwise the model of adversary would be too strong even for “obviously correct ” protocols. We propose a processalgebraic framework in which the control on the scheduler can be specified in syntactic terms, and we show how to apply it to solve the problem mentioned above. We also consider the definition of (probabilistic) may and must preorders, and we show that they are precongruences with respect to the restricted schedulers. Furthermore, we show that all the operators of the language, except replication, distribute over probabilistic summation, which is a useful property for verification. 1
Continuous capacities on continuous state spaces
 In ICALP’2007. SpringerVerlag LNCS
, 2007
"... Abstract. We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic games are just variations on continuous Markov chains. We argue that drawing at random along a belief function ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Abstract. We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic games are just variations on continuous Markov chains. We argue that drawing at random along a belief function is the same as letting the probabilistic player P play first, then letting the nondeterministic player C play demonically. The same holds for an angelic C, using plausibilities instead. We then define a simple modal logic, and characterize simulation in terms of formulae of this logic. Finally, we show that (discounted) payoffs are defined and unique, where in the demonic case, P maximizes payoff, while C minimizes it. 1
A Probabilistic Applied Pi–Calculus
, 2007
"... We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nonde ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nondeterministic choice among the probability distributions over target states. Notions of static and observational equivalence are given for the enriched calculus. In order to model the possible interaction of a process with its surrounding environment a labeled semantics is given together with a notion of weak bisimulation which is shown to coincide with the observational equivalence. Finally, we prove that results in the probabilistic framework are preserved in a purely nondeterministic setting.
Duality for Labelled Markov Processes
"... Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a `universal' LMP as the spectrum of a commutative C # algebra consisting of formal linear combinations of labelled trees. We characterize the state space of the univ ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a `universal' LMP as the spectrum of a commutative C # algebra consisting of formal linear combinations of labelled trees. We characterize the state space of the universal LMP as the set of homomorphims from an ordered commutative monoid of labelled trees into the multiplicative unit interval. This yields a simple semantics for LMPs which is fully abstract with respect to probabilistic bisimilarity. We also consider LMPs with entry points and exit points in the setting of iteration theories. We define an iteration theory of LMPs by specifying its categorical dual: a certain category of C*algebras. We find that the basic operations for composing LMPs have simple definitions in the dual category.
Deriving syntax and axioms for quantitative regular behaviours
, 2009
"... We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions ar ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying (functor) type of these coalgebras. In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA’s) and Milner (on regular behaviours and finite LTS’s), and includes many other systems such as Mealy and Moore machines. In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.
Events, Causality and Symmetry
, 2008
"... The article discusses causal models, such as Petri nets and event structures, how they have been rediscovered in a wide variety of recent applications, and why they are fundamental to computer science. A discussion of their present limitations leads to their extension with symmetry. The consequences ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The article discusses causal models, such as Petri nets and event structures, how they have been rediscovered in a wide variety of recent applications, and why they are fundamental to computer science. A discussion of their present limitations leads to their extension with symmetry. The consequences, actual and potential, are discussed.
Characterising probabilistic processes logically
, 2009
"... Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mucalculus and show how to derive characteristic formulae for various simulationlike preorders over finitestat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mucalculus and show how to derive characteristic formulae for various simulationlike preorders over finitestate processes without divergence. In addition, we show that even without the fixpoint operators this probabilistic mucalculus can be used to characterise these behavioural relations in the sense that two states are equivalent if and only if they satisfy the same set of formulae. 1
Proving Approximate Implementations for Probabilistic I/O Automata?? Abstract
, 2006
"... In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally controlled actions and a task scheduler to resolve nondeterminism. The interaction between a schedu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally controlled actions and a task scheduler to resolve nondeterminism. The interaction between a scheduler and an automaton gives rise to a trace distribution—a probability distribution over the set of traces. We define a PIOA to be a (discounted) approximate implementation of another PIOA if the set of trace distributions produced by the first is close to that of the latter, where closeness is measured by the (resp. discounted) uniform metric over trace distributions. We propose simulation functions for proving approximate implementations corresponding to each of the above types of approximate implementation relations. Since our notion of similarity of traces is based on a metric on trace distributions, we do not require the state spaces nor the space of external actions of the automata to be metric spaces. We discuss applications of approximate implementations to verification of probabilistic safety and termination.
A Local Algorithm for Checking Probabilistic Bisimilarity
"... Abstract—Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the whole state spaces in advance, and local algorithms combine the verification of a system’s behaviour with the generation of the system’s state space, which is often more effective to determine that one system fails to be related to another. Although local algorithms are well established in the classical concurrency theory, the study of local algorithms in probabilistic concurrency theory is not mature. In this paper we propose a polynomial time local algorithm for checking probabilistic bisimilarity. With mild modification, the algorithm can be easily adapted to decide probabilistic similarity with the same time complexity. Keywordsconcurrency; probabilistic bisimilarity; local algorithm; probabilistic labelled transition systems; I.