Markov Chains and Unambiguous Büchi Automata

DOI10.1007/978-3-319-41528-4_2zbMath1411.68051OpenAlexW2346095506MaRDI QIDQ4633525

Joachim Klein, Stefan Kiefer, Sascha Klüppelholz, David Müller, Christel Baier, James Worrell

Publication date: 3 May 2019

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:77f47690-52a3-4b1b-8a45-3cb69e3cbe75

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (12)

From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ On the power of finite ambiguity in Büchi complementation ⋮ Model checking differentially private properties ⋮ Markov chains and unambiguous automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-deterministic Weighted Automata on Random Words ⋮ Non-deterministic weighted automata evaluated over Markov chains ⋮ Unnamed Item ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ Image-binary automata

This page was built for publication: Markov Chains and Unambiguous Büchi Automata