Sciweavers

BIRTHDAY
2005
Springer

Compositional Reasoning for Probabilistic Finite-State Behaviors

14 years 4 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
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.
Yuxin Deng, Catuscia Palamidessi, Jun Pang
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where BIRTHDAY
Authors Yuxin Deng, Catuscia Palamidessi, Jun Pang
Comments (0)