Process Algebra with Probabilistic Choice

Andova, Suzana

doi:10.1007/3-540-48778-6_7

Cited by 34 publications

(27 citation statements)

References 12 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a similar way, the probabilistic contract theory must be compared with stochastic process algebras [2,38]. In both cases, the main difference is that compositional reasoning is possible only in contract theories thanks to the fact that contracts are implications where an assumption implies a guarantee.…”

Section: Some Related Workmentioning

confidence: 99%

Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects

Delahaye

Caillaud

Legay

2010

Form Methods Syst Des

View full text Add to dashboard Cite

A contract allows to distinguish hypotheses made on a system (the guarantees) from those made on its environment (the assumptions). In this paper, we focus on models of Assume/Guarantee contracts for (stochastic) systems. We consider contracts capable of capturing reliability and availability properties of such systems. We also show that classical notions of Satisfaction and Refinement can be checked by effective methods thanks to a reduction to classical verification problems. Finally, theorems supporting compositional reasoning and enabling the scalable analysis of complex systems are also studied.

show abstract

Section: Some Related Workmentioning

confidence: 99%

Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects

Delahaye

Caillaud

Legay

2010

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…It is more general than earlier formats [LT05,LT09] which consider transitions of the form t a,q − −− → t ′ modeling that term t reaches through action a the term t ′ with probability q. The probabilistic GSOS format allows us to specify probabilistic nondeterministic process algebras, such as probabilistic CCS [JLY01, Bar04,DD07], probabilistic CSP [JLY01, Bar04, DvGH + 07, DL12] and probabilistic ACP [And99,And02].…”

Section: Pgsos Specificationsmentioning

confidence: 99%

“…Probabilistic process algebras, such as probabilistic CCS [JLY01, Bar04,DD07], CSP [JLY01, Bar04, DvGH + 07, DL12] and ACP [And99,And02], are languages that are employed to describe probabilistic concurrent communicating systems, or probabilistic processes for short. Nondeterministic probabilistic transition systems [Seg95] combine labeled transition systems [Kel76] and discrete time Markov chains [Ste94,HJ94].…”

Section: Introductionmentioning

confidence: 99%

Compositional bisimulation metric reasoning with Probabilistic Process Calculi

Gebler¹,

Larsen

Tini

2017

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the distance between probabilistic processes composed by standard process algebra operators. Combining these results, we demonstrate how compositional reasoning about systems specified by continuous process algebra operators allows for metric assume-guarantee like performance validation.

show abstract

“…Works on behavioral types in process algebras bear commonalities with contract theories. In a similar way, the probabilistic contract theory must be compared with stochastic process algebras [14], [15]. In both cases, the main difference is that compositional reasoning is possible only in contract theories thanks to the fact that contracts are implications where an assumption implies a guarantee.…”

Section: Introductionmentioning

confidence: 99%