Compositional Reasoning for Probabilistic Finite-State Behaviors - Archive ouverte HAL Access content directly
Book Sections Year : 2005

Compositional Reasoning for Probabilistic Finite-State Behaviors

(1) , (2) , (2)
1
2

Abstract

We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes parallel composition and (guarded) recursion. The presence of the parallel composition introduces various technical difficulties and some restrictions are necessary in order to achieve complete axiomatizations.
Fichier principal
Vignette du fichier
par.pdf (252.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00201100 , version 1 (23-12-2007)

Identifiers

Cite

Yuxin Deng, Catuscia Palamidessi, Jun Pang. Compositional Reasoning for Probabilistic Finite-State Behaviors. Aart Middeldorp and Vincent van Oostrom and Femke van Raamsdonk and Roel C. de Vrijer. Processes, Terms and Cycles: Steps on the Road to Infinity, 3838, Springer, pp.309-337, 2005, Lecture Notes in Computer Science, ⟨10.1007/11601548_17⟩. ⟨inria-00201100⟩
228 View
94 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More