Markov chains and unambiguous automata
From MaRDI portal
Publication:6098148
DOI10.1016/j.jcss.2023.03.005arXiv1605.00950OpenAlexW2912375266MaRDI QIDQ6098148
James Worrell, Stefan Kiefer, David Müller, Christel Baier, Joachim Klein
Publication date: 12 June 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00950
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
- Complementation of finitely ambiguous Büchi automata
- Automata, logics, and infinite games. A guide to current research
- From LTL to deterministic automata. A safraless compositional approach
- Forms of Determinism for Automata (Invited Talk)
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Parametric LTL on Markov Chains
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
- Solving Games Without Determinization
- On Relating Time and Space to Size and Depth
- The complexity of probabilistic verification
- Markov Chains and Unambiguous Büchi Automata
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Fast parallel matrix and GCD computations
- Two Variable vs. Linear Temporal Logic in Model Checking and Games
- Manipulating LTL Formulas Using Spot 1.0
- Computer Aided Verification
- LTL Model Checking of Interval Markov Chains
- Ambiguity, Nondeterminism and State Complexity of Finite Automata
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- Unambiguity in Automata Theory
This page was built for publication: Markov chains and unambiguous automata
