Abstraction in Probabilistic Process Algebra

Andova, Suzana; Baeten, J.C.M.

doi:10.1007/3-540-45319-9_15

Cited by 19 publications

(42 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To overcome this problem, we take some inspiration from Andova and Baeten [26], and consider a state to be a representation of the distribution that is obtained by fusing distributions reachable by internal transition, as long as there is no non-determinism. In the example above, this would remove our problems, since we would then consider v ′ to represent the distribution (E,…”

Section: Weak Bisimilaritymentioning

confidence: 99%

On Probabilistic Automata in Continuous Time

Eisentraut

Hermanns

Zhang

2010

2010 25th Annual IEEE Symposium on Logic in Computer Science

131

235

View full text Add to dashboard Cite

Abstract. We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. The model is rich enough to embody the semantics of generalised stochastic Petri nets. We define strong and weak bisimulations and discuss their compositionality properties. Weak bisimulation is partly oblivious to the probabilistic branching structure, in order to reflect some natural equalities in this spectrum of models. As a result, the standard way to associate a stochastic process to a generalised stochastic Petri net can be proven sound with respect to weak bisimulation.

show abstract

Section: Weak Bisimilaritymentioning

confidence: 99%

On Probabilistic Automata in Continuous Time

Eisentraut

Hermanns

Zhang

2010

2010 25th Annual IEEE Symposium on Logic in Computer Science

131

235

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

“…The last decade has witnessed increasing interest in the area of formal methods for the specification and analysis of probabilistic systems [11,3,15,6]. In [16] van Glabbeek et al classified probabilistic models into reactive, generative and stratified.…”

Section: Introductionmentioning

confidence: 99%

“…However, in each of the systems either weak bisimulation is not investigated [4,2] or nondeterministic choice is prohibited [4,3].…”

Section: Introductionmentioning

confidence: 99%

Axiomatizations for Probabilistic Finite-State Behaviors

Deng

Palamidessi

2005

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguarded recursion the "natural" weak equivalences are undecidable. This is the first work, to our knowledge, that provides a complete axiomatization for weak equivalences in the presence of recursion and both nondeterministic and probabilistic choice.

show abstract

Abstraction in Probabilistic Process Algebra

Cited by 19 publications

References 6 publications

On Probabilistic Automata in Continuous Time

On Probabilistic Automata in Continuous Time

Compositional bisimulation metric reasoning with Probabilistic Process Calculi

Axiomatizations for Probabilistic Finite-State Behaviors

Contact Info

Product

Resources

About