Abstract. Action systems are a construct for reasoning about concur-rent, reactive systems, in which concurrent behaviour is described by in-terleaving atomic actions. Sere and Troubitsyna have proposed an exten-sion 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 probabilis-tic action systems. This semantics provides a simple theoretical base on which practical refinement rules for probabilistic action systems may be justified.
Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness f...
AbstractWe propose a formal language for the specification of trace properties of probabilistic, non...
Abstract. We propose an abstract algebra for reasoning about probabilistic programs. In contrast to ...
Action systems are a construct for reasoning about concurrent, reactive systems, in which concurrent...
A trace semantics is given for a probabilistic reactive language which is capable of modelling proba...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
We present the language ¡£¢¥¤ for probabilistic reasoning about actions, which is a generalization o...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calcul...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
The action language C+ is an important high-level formalism for describing actions, which has evolv...
AbstractThis paper discusses trace semantics of interactive Markov chains (IMCs) that are a generali...
Abstract. We present acompositional trace-based modelfor probabilistic systems. The behavior of a sy...
Abstract. We propose a formal language for the specification of trace properties of probabilistic, n...
Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness f...
AbstractWe propose a formal language for the specification of trace properties of probabilistic, non...
Abstract. We propose an abstract algebra for reasoning about probabilistic programs. In contrast to ...
Action systems are a construct for reasoning about concurrent, reactive systems, in which concurrent...
A trace semantics is given for a probabilistic reactive language which is capable of modelling proba...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
We present the language ¡£¢¥¤ for probabilistic reasoning about actions, which is a generalization o...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calcul...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
The action language C+ is an important high-level formalism for describing actions, which has evolv...
AbstractThis paper discusses trace semantics of interactive Markov chains (IMCs) that are a generali...
Abstract. We present acompositional trace-based modelfor probabilistic systems. The behavior of a sy...
Abstract. We propose a formal language for the specification of trace properties of probabilistic, n...
Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness f...
AbstractWe propose a formal language for the specification of trace properties of probabilistic, non...
Abstract. We propose an abstract algebra for reasoning about probabilistic programs. In contrast to ...