13 citations · 16 across the 7 of their papers we have counts for
9 papers · 1 filter
Layered automata: A canonical model for automata over infinite words
Antonio Casares, Christof Löding, Igor Walukiewicz
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history determ…
Constructing deterministic -automata from examples by an extension of the RPNI algorithm
León Bohn, Christof Löding
The RPNI algorithm (Oncina, Garcia 1992) constructs deterministic finite automata from finite sets of negative and positive example words. We propose and analyze an extension of th…
Synthesis from Weighted Specifications with Partial Domains over Finite Words
Emmanuel Filiot, Christof Löding, Sarah Winter
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose execution…
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…
New Pumping Technique for 2-dimensional VASS
Wojciech Czerwiński, Sławomir Lasota, Christof Löding +1
We propose a new pumping technique for 2-dimensional vector addition systems with states (2-VASS) building on natural geometric properties of runs. We illustrate its applicability…