Recurrence and Transience for Probabilistic Automata.

From MaRDI portal

Revision as of 20:13, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2920147

Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2009.2335zbMath1248.68337OpenAlexW1525053111MaRDI QIDQ2920147

Mathieu Tracol, Marcus Größer, Christel Baier

Publication date: 24 October 2012

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

zbMATH Keywords

Markov chains recurrence Büchi automata probabilistic automata omega-regular properties

Mathematics Subject Classification ID

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

Related Items (3)

Recurrence and transience for finite probabilistic tables ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Partial-Observation Stochastic Games

This page was built for publication: Recurrence and Transience for Probabilistic Automata.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2920147&oldid=15893092"