A Probabilistic Kleene Theorem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A Probabilistic Kleene Theorem

Résumé

We provide a Kleene Theorem for (Rabin) probabilistic automata over finite words. Probabilistic automata generalize deterministic finite automata and assign to a word an acceptance probability. We provide probabilistic expressions with probabilistic choice, guarded choice, concatenation, and a star operator. We prove that probabilistic expressions and probabilistic automata are expressively equivalent. Our result actually extends to two-way probabilistic automata with pebbles and corresponding expressions.
Fichier principal
Vignette du fichier
BGMZ-atva12.pdf (290.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00909042 , version 1 (26-11-2013)

Identifiants

Citer

Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. A Probabilistic Kleene Theorem. Automated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. pp.400-415, ⟨10.1007/978-3-642-33386-6_31⟩. ⟨hal-00909042⟩
136 Consultations
112 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More