Recurrence and transience for probabilistic automata

DOI10.4230/LIPICS.FSTTCS.2009.2335MaRDI QIDQ2920147zbMATH OpenOpenAlexFDO

Authors Mathieu Tracol, Marcus Grösser, Christel Baier

Publication date 24 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_49d9.html

zbMATH Keywords

Markov chainsprobabilistic automatarecurrenceomega-regular propertiesBüchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Probabilistic ω-automata
• On Decision Problems for Probabilistic Büchi Automata
• Probabilistic automata over infinite words: expressiveness, efficiency, and decidability
• Decidable problems for probabilistic automata on infinite words
• Probabilistic automata on infinite words: decidability and undecidability results

Cited in

(4)

• scientific article; zbMATH DE number 1795912 (Why is no real title available?)
• Emptiness and universality problems in timed automata with positive frequency
• Recurrence and transience for finite probabilistic tables
• Partial-observation stochastic games, how to win when belief fails

This page was built for publication: Recurrence and transience for probabilistic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920147)