The Effect of Tossing Coins in Omega-Automata

DOI10.1007/978-3-642-04081-8_2zbMath1254.68142OpenAlexW1897509516MaRDI QIDQ3184662

Nathalie Bertrand, Marcus Größer, Christel Baier

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Partial-Observation Stochastic Games

Cites Work

• Unnamed Item
• Unnamed Item
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Automata, logics, and infinite games. A guide to current research
• On the expressiveness and complexity of randomization in finite state monitors
• Algorithms for Omega-Regular Games with Imperfect Information
• The complexity of probabilistic verification
• On Decision Problems for Probabilistic Büchi Automata
• Some aspects of probabilistic automata
• Probabilistic automata
• Power of Randomization in Automata on Infinite Strings

This page was built for publication: The Effect of Tossing Coins in Omega-Automata