307 citations
- Auckland University of TechnologyNZ5 papers
- Leibniz University HannoverDE5 papers
- IT University of CopenhagenDK4 papers
- Karlsruhe Institute of TechnologyDE4 papers
- Reutlingen UniversityDE4 papers
- Technical University of MunichDE4 papers
- TU WienAT4 papers
- The University of Texas at AustinUS3 papers
- University of TartuEE3 papers
- Aix-Marseille UniversitéFR2 papers
- Board of the Swiss Federal Institutes of TechnologyCH2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
4 papers · 1 filter
How Concise are Chains of co-Büchi Automata?
Rüdiger Ehlers
Chains of co-Büchi automata (COCOA) have recently been introduced as a new canonical model for representing arbitrary omega-regular languages. They can be minimized in polynomial t…
From LTL to COCOA without Detours
Rüdiger Ehlers, Ayrat Khalimov
Chains of co-Büchi automata (COCOA) have recently been introduced as a new canonical representation of omega-regular languages. The co-Büchi automata in a chain assign each omega-w…
Adapting to the Behavior of Environments with Bounded Memory
Dhananjay Raju, Rüdiger Ehlers, Ufuk Topcu
We study the problem of synthesizing implementations from temporal logic specifications that need to work correctly in all environments that can be represented as transducers with…
Playing Against Opponents With Limited Memory
Dhananjay Raju, Rüdiger Ehlers, Ufuk Topcu
We study \emph{partial-information} two-player turn-based games on graphs with omega-regular objectives, when the partial-information player has \emph{limited memory}. Such games a…