We extend the stratified model of probabilistic processes presented in [vGSS] to obtain a very general notion of process priority . The main idea is to allow probability guards of value 0 to be associated with alternatives of a probabilistic summation expression. Such alternatives can be chosen only if the non-zero alternatives are precluded by contextual constraints. We refer to this model as one of "extremal probability" and to its signature as PCCS i , where the i signifies the possibility of zero-probability alternatives. We provide PCCS i with a structural operational semantics and a notion of probabilistic bisimulation, which is shown to be a congruence. Of particular interest is the abstraction PCCS ß of PCCS i in which all...
AbstractWe explore the suitability of two semantic spaces as a basis for a probabilistic variant of ...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Abstract. Jones and Plotkin give a general construction for forming a probabilistic powerdomain over...
AbstractWe introduce three models of probabilistic processes, namely, reactive, generative, and stra...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
We propose both an SOS transition rule format for the generative model of probabilistic processes, a...
Abstract. We present P-, a Stochastic Process Algebra (SPA) that allows for the model-ing of timed s...
This paper proposes a simple operational semanticsof pGCL, Dijkstra's guarded command language exten...
Process algebras with abstraction have been widely used for the specification and verification of no...
This paper proposes a simple operational semantics of pGCL, Dijkstra's guarded command language exte...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractIn this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator....
Subject matter With the rapid development of computer network and communication technology, the stud...
Abstract Defining operational semantics for a process algebra is often based either on labeled trans...
Defining operational semantics for a process algebra is often based either on labeled transition sys...
AbstractWe explore the suitability of two semantic spaces as a basis for a probabilistic variant of ...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Abstract. Jones and Plotkin give a general construction for forming a probabilistic powerdomain over...
AbstractWe introduce three models of probabilistic processes, namely, reactive, generative, and stra...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
We propose both an SOS transition rule format for the generative model of probabilistic processes, a...
Abstract. We present P-, a Stochastic Process Algebra (SPA) that allows for the model-ing of timed s...
This paper proposes a simple operational semanticsof pGCL, Dijkstra's guarded command language exten...
Process algebras with abstraction have been widely used for the specification and verification of no...
This paper proposes a simple operational semantics of pGCL, Dijkstra's guarded command language exte...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractIn this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator....
Subject matter With the rapid development of computer network and communication technology, the stud...
Abstract Defining operational semantics for a process algebra is often based either on labeled trans...
Defining operational semantics for a process algebra is often based either on labeled transition sys...
AbstractWe explore the suitability of two semantic spaces as a basis for a probabilistic variant of ...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Abstract. Jones and Plotkin give a general construction for forming a probabilistic powerdomain over...