Compositional Reasoning for Probabilistic Finite-State Behaviors

Yuxin Deng (1) , Catuscia Palamidessi (2) , Jun Pang (2)

1 PPS - Preuves, Programmes et Systèmes
2 COMETE - Concurrency, Mobility and Transactions

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.

Domaines: Logique en informatique [cs.LO]

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⟩