Article thumbnail

Axiomatizations for probabilistic finite-state behaviors

By Yuxin Deng and Catuscia Palamidessi

Abstract

International audienceWe study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguarded recursion the 'natural' weak equivalences are undecidable. This is the first work, to our knowledge, that provides a complete axiomatization for weak equivalences in the presence of recursion and both nondeterministic and probabilistic choice

Topics: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: 'Springer Science and Business Media LLC'
Year: 2005
DOI identifier: 10.1007/b106850
OAI identifier: oai:HAL:inria-00201123v1

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles