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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Compositional Reasoning for Probabilistic Finite-State Behaviors
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA