Skip to Main content Skip to Navigation
Book sections

Compositional Reasoning for Probabilistic Finite-State Behaviors

Yuxin Deng 1 Catuscia Palamidessi 2 Jun Pang 2
2 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
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.
Document type :
Book sections
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi <>
Submitted on : Sunday, December 23, 2007 - 5:01:55 PM
Last modification on : Friday, March 27, 2020 - 2:55:28 AM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:29:49 PM


Files produced by the author(s)




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⟩



Record views


Files downloads