| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Symbolic Bisimulation for Probabilistic Systems
Abstract : The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations between probabilistic systems. Especially the definition of weak (symbolic) bisimulation does not rely on the random capability of adversaries and sug- gests a solution to the open problem on the axiomati- zation for weak bisimulation in the case of unguarded recursion. Furthermore, we present an efficient char- acterization of symbolic bisimulations for the calculus, which allows the ”on-the-fly” instantiation of bound names and dynamic construction of equivalence rela- tions for quantitative evaluation. This directly results in a local decision algorithm that can explore just a minimal portion of the state spaces of probabilistic pro- cesses in question.
Cited literature [23 references]
https://hal.inria.fr/inria-00201068
Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Sunday, December 23, 2007 - 12:58:19 AM
Last modification on : Thursday, January 20, 2022 - 4:12:24 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:21:38 PM
Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Sunday, December 23, 2007 - 12:58:19 AM
Last modification on : Thursday, January 20, 2022 - 4:12:24 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:21:38 PM
File
qest2.pdf
Files produced by the author(s)