Symbolic Bisimulation for Probabilistic Systems

Peng Wu 1 Catuscia Palamidessi 1 Huimin Lin 2
1 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7161
2 LCS - State Key Laboratory of Computer Science [Beijing]
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.
Type de document :
Communication dans un congrès
4th International Conference on the Quantitative Evaluation of SysTems (QEST), Sep 2007, Edinburgh, United Kingdom. IEEE Computer Society, pp.179-188, 2007, Proceedings of the 4th International Conference on the Quantitative Evaluation of SysTems. 〈10.1109/QEST.2007.46〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/inria-00201068
Contributeur : Catuscia Palamidessi <>
Soumis le : dimanche 23 décembre 2007 - 00:58:19
Dernière modification le : jeudi 12 avril 2018 - 01:45:37
Document(s) archivé(s) le : mardi 13 avril 2010 - 15:21:38

Fichier

qest2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

INRIA | LIX | X-LIX | X | PARISTECH

Citation

Peng Wu, Catuscia Palamidessi, Huimin Lin. Symbolic Bisimulation for Probabilistic Systems. 4th International Conference on the Quantitative Evaluation of SysTems (QEST), Sep 2007, Edinburgh, United Kingdom. IEEE Computer Society, pp.179-188, 2007, Proceedings of the 4th International Conference on the Quantitative Evaluation of SysTems. 〈10.1109/QEST.2007.46〉. 〈inria-00201068〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

298

Téléchargements de fichiers

97

Contact


archive-ouverte@inria.fr