Stochastic Bounds for Partially generated Markov chains: an algebraic approach

Ana Busic 1 Jean-Michel Fourneau 1, 2
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
Abstract : We propose several algorithms to obtain bounds based on Censored Markov Chains to analyze partially generated discrete time Markov chains. The main idea is to avoid the generation of a huge (or even infinite) state space and to truncate the state space during the visit. The approach is purely algebraic and provides element-wise and stochastic bounds for the CMC.
Type de document :
Communication dans un congrès
Fith European Performance Engineering Workshop, EPEW 2008, Proceedings, 2008, Palma de Mallorca, Spain. Springer, pp.227-241, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-87412-6_17〉
Liste complète des métadonnées
https://hal.inria.fr/hal-00953620
Contributeur : Arnaud Legrand <>
Soumis le : vendredi 28 février 2014 - 14:11:42
Dernière modification le : jeudi 11 octobre 2018 - 08:48:02

Identifiants

Collections

INRIA | PRISM | UGA | UVSQ | LIG | LIG_SRCPR

Citation

Ana Busic, Jean-Michel Fourneau. Stochastic Bounds for Partially generated Markov chains: an algebraic approach. Fith European Performance Engineering Workshop, EPEW 2008, Proceedings, 2008, Palma de Mallorca, Spain. Springer, pp.227-241, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-87412-6_17〉. 〈hal-00953620〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

285

Contact


archive-ouverte@inria.fr