Recurrence and Transience for Probabilistic Automata.
From MaRDI portal
Publication:2920147
DOI10.4230/LIPIcs.FSTTCS.2009.2335zbMath1248.68337MaRDI 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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Partial-Observation Stochastic Games, Recurrence and transience for finite probabilistic tables, Emptiness and Universality Problems in Timed Automata with Positive Frequency