8 citations · 13 across the 5 of their papers we have counts for
5 papers
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
Christof Löding, Anton Pirogov
Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still ope…
New Optimizations and Heuristics for Determinization of Büchi Automata
Christof Löding, Anton Pirogov
In this work, we present multiple new optimizations and heuristics for the determinization of Büchi automata that exploit a number of semantic and structural properties, most of wh…
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp
Christof Löding, Anton Pirogov
Determinization of Büchi automata is a long-known difficult problem and after the seminal result of Safra, who developed the first asymptotically optimal construction from Büchi in…
Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic
Normann Decker, Anton Pirogov
This paper presents an approximation approach to verifying counter systems with respect to properties formulated in an expressive counting extension of linear temporal logic. It ca…
On finitely ambiguous Büchi automata
Christof Löding, Anton Pirogov
Unambiguous Büchi automata, i.e. Büchi automata allowing only one accepting run per word, are a useful restriction of Büchi automata that is well-suited for probabilistic model-che…