Results 11 
17 of
17
Measuring the Confinement of Concurrent Probabilistic Systems
 In Proc. of WITS’03 – 2003 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security
, 2003
"... 1 Dipartimento di Informatica, Universit'a di Pisa, Italy 2 ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
1 Dipartimento di Informatica, Universit'a di Pisa, Italy 2
GSOS for probabilistic transition systems (Extended Abstract)
, 2002
"... We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all mode ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the uptocontext proof principle is valid. Moreover, every specification has a final model which can be shown to offer unique solutions for guarded recursive equations. The format covers operator specifications from the literature, so that the wellbehavedness results given for those arise as instances of our general one.
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
, 2001
"... This paper provides a casestudy in the eld of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language L pr , which features action refinement and probabilistic choice. The two models are constructed in the setti ..."
Abstract
 Add to MetaCart
This paper provides a casestudy in the eld of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language L pr , which features action refinement and probabilistic choice. The two models are constructed in the setting of complete ultrametric spaces, here based on probability measures of compact support over sequences of actions. It is shown that the standard toolkit for metric semantics works well in the probabilistic context of L pr , e.g. in establishing the correctness of the denotational semantics with respect to the operational one. In addition, it is shown how the method of proving full abstraction  as proposed recently by the authors for a nondeterministic language with action refinement  can be adapted to deal with the probabilistic language L pr as well.
PCSP: A Denotational Model of Probabilistic Processes
, 1996
"... We present a model of probabilistic processes based on an asynchronous algebra, starting from the classical CSP; replacing internal nondeterminism by generative probabilistic choices, and external nondeterminism by reactive probabilistic choices. Our purpose when defining the model has been to main ..."
Abstract
 Add to MetaCart
We present a model of probabilistic processes based on an asynchronous algebra, starting from the classical CSP; replacing internal nondeterminism by generative probabilistic choices, and external nondeterminism by reactive probabilistic choices. Our purpose when defining the model has been to maintain, as far as possible, the meaning of all the operators in classical CSP, generalizing their meaning in a probabilistic way. Thus we try to keep valid (once probabilistically generalized), as far as possible, the laws of CSP. It is the combination of both internal and external choice that makes strongly difficult the definition of a probabilistic version of CSP. We can find in the current literature quite a number of papers on probabilistic processes, but only in a few of them internal and external choices are combined, trying to preserve their original meaning.
A Sound and Complete Proof System for Probabilistic Processes
, 1997
"... In this paper we present a process algebra model of probabilistic communicating processes based on classical CSP. To define our model we have replaced internal nondeterminism by generative probabilistic choices, and external nondeterminism by reactive probabilistic choices, with the purpose of mai ..."
Abstract
 Add to MetaCart
In this paper we present a process algebra model of probabilistic communicating processes based on classical CSP. To define our model we have replaced internal nondeterminism by generative probabilistic choices, and external nondeterminism by reactive probabilistic choices, with the purpose of maintaining the meaning of the classical CSP operators, once generalized in a probabilistic way. Thus we try to keep valid, as far as possible, the laws of CSP. This combination of both internal and external choice makes strongly difficult the definition of a probabilistic version of CSP. In fact, we can find in the current literature quite a number of papers on probabilistic processes, but only in a few of them internal and external choices are combined, trying to preserve their original meaning.
Including General Equilibrium Theory into FDTs: A First Approach
"... In this paper we present a process algebra to specify systems that depend, for their execution, on a set of resources that they own. Besides, in order to improve their performance, processes will be able to exchange resources between them. In order to de ne this new language we will borrow some ..."
Abstract
 Add to MetaCart
In this paper we present a process algebra to specify systems that depend, for their execution, on a set of resources that they own. Besides, in order to improve their performance, processes will be able to exchange resources between them. In order to de ne this new language we will borrow some concepts from microeconomic theory. Our language will be de ned in two steps. We will assume that we have a base language to specify the behavior of processes.
Metric Denotational Semantics for
 Proceedings of the Fourth Annual Workshop on Process Algebra and Performance Modelling
, 1996
"... Stochastic process algebras, which combine the features of a process calculus with stochastic analysis, were introduced to enable compositional performance analysis of systems. At the level of syntax, compositionality presents itself in terms of operators, which can be used to build more complex ..."
Abstract
 Add to MetaCart
Stochastic process algebras, which combine the features of a process calculus with stochastic analysis, were introduced to enable compositional performance analysis of systems. At the level of syntax, compositionality presents itself in terms of operators, which can be used to build more complex systems from simple components. Denotational semantics is a method for assigning to syntactic objects elements of a suitably chosen semantic domain. This is compositional in style, as operators are represented by certain functions on the domain, and often allows to gain additional insight by considering the properties of those functions. We consider Performance Evaluation Process Algebra (PEPA), a stochastic process algebra introduced by Hillston [9].