Action systems are a construct for reasoning about concurrent, reactive systems, in which concurrent behaviour is described by interleaving atomic actions. Sere and Troubitsyna have proposed an extension to action systems in which actions may be expressed and composed using discrete probabilistic choice as well as demonic nondeterministic choice. In this paper we develop a trace-based semantics for probabilistic action systems. This semantics provides a simple theoretical base on which practical refinement rules for probabilistic action systems may be justified
The first part of the paper is an introduction to the theory of probabilistic concurrent systems und...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Subject matter With the rapid development of computer network and communication technology, the stud...
Abstract. Action systems are a construct for reasoning about concur-rent, reactive systems, in which...
A trace semantics is given for a probabilistic reactive language which is capable of modelling proba...
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
AbstractThis paper discusses trace semantics of interactive Markov chains (IMCs) that are a generali...
We present the language ¡£¢¥¤ for probabilistic reasoning about actions, which is a generalization o...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calcul...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
It is well known that trace and testing semantics over nondeterministic and probabilistic processes ...
The first part of the paper is an introduction to the theory of probabilistic concurrent systems und...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Subject matter With the rapid development of computer network and communication technology, the stud...
Abstract. Action systems are a construct for reasoning about concur-rent, reactive systems, in which...
A trace semantics is given for a probabilistic reactive language which is capable of modelling proba...
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
AbstractThis paper discusses trace semantics of interactive Markov chains (IMCs) that are a generali...
We present the language ¡£¢¥¤ for probabilistic reasoning about actions, which is a generalization o...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calcul...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
It is well known that trace and testing semantics over nondeterministic and probabilistic processes ...
The first part of the paper is an introduction to the theory of probabilistic concurrent systems und...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
Subject matter With the rapid development of computer network and communication technology, the stud...