Axiomatizations for probabilistic finite-state behaviors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Axiomatizations for probabilistic finite-state behaviors


We 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.
Fichier principal
Vignette du fichier
fossacs05.pdf (237.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00201123 , version 1 (23-12-2007)



Yuxin Deng, Catuscia Palamidessi. Axiomatizations for probabilistic finite-state behaviors. 8th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2005), Apr 2005, Edinburgh, United Kingdom. pp.110-124, ⟨10.1007/b106850⟩. ⟨inria-00201123⟩
311 View
277 Download



Gmail Facebook Twitter LinkedIn More