| Publication | Date of Publication | Type |
|---|
| Perspective games | 2024-04-26 | Paper |
| The complexity of LTL rational synthesis | 2024-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070602 | 2023-11-23 | Paper |
| Lazy regular sensing | 2023-08-18 | Paper |
| A Hierarchy of Nondeterminism | 2023-08-08 | Paper |
| Reasoning about Quality and Fuzziness of Strategic Behaviors | 2023-07-18 | Paper |
| A space-efficient on-the-fly algorithm for real-time model checking | 2023-06-28 | Paper |
| Minimization of automata for liveness languages | 2023-06-02 | Paper |
| On the complexity of verifying concurrent transition systems | 2023-05-17 | Paper |
| Fair simulation | 2023-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874196 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875386 | 2023-02-03 | Paper |
| Lazy regular sensing | 2023-01-18 | Paper |
| Timed network games | 2023-01-12 | Paper |
| Multi-Valued Reasoning about Reactive Systems | 2023-01-11 | Paper |
| On (I/O)-Aware Good-For-Games Automata | 2022-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101349 | 2022-08-30 | Paper |
| Quantitative assume guarantee synthesis | 2022-08-12 | Paper |
| Minimizing GFG Transition-Based Automata | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089219 | 2022-07-18 | Paper |
| On Repetition Languages | 2022-07-18 | Paper |
| Certifying DFA bounds for recognition and separation | 2022-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021013 | 2022-01-11 | Paper |
| What's decidable about weighted automata? | 2022-01-06 | Paper |
| Verification | 2021-11-12 | Paper |
| Certifying inexpressibility | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005123 | 2021-08-04 | Paper |
| Spanning-Tree Games. | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002847 | 2021-07-28 | Paper |
| Mutually accepting capacitated automata | 2021-07-14 | Paper |
| Games with full, longitudinal, and transverse observability | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992510 | 2021-06-09 | Paper |
| Timed vacuity | 2021-05-04 | Paper |
| Good-enough synthesis | 2021-02-09 | Paper |
| How Deterministic are Good-For-Games Automata? | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136330 | 2020-11-25 | Paper |
| Hierarchical Network Formation Games | 2020-08-05 | Paper |
| On Synthesis of Specifications with Arithmetic | 2020-07-20 | Paper |
| Properties and Utilization of Capacitated Automata (Invited Talk) | 2020-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111621 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111251 | 2020-05-26 | Paper |
| Dynamic resource allocation games | 2020-01-22 | Paper |
| Capacitated automata and systems | 2019-12-18 | Paper |
| Sensing as a Complexity Measure | 2019-12-10 | Paper |
| A Parametrized Analysis of Algorithms on Hierarchical Graphs | 2019-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4972740 | 2019-11-26 | Paper |
| Playing with the Maximum-Flow Problem | 2019-07-04 | Paper |
| LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems | 2019-07-04 | Paper |
| Alternating Reachability Games with Behavioral and Revenue Objectives | 2019-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633896 | 2019-05-06 | Paper |
| Spanning the spectrum from safety to liveness | 2018-12-12 | Paper |
| An abstraction-refinement methodology for reasoning about network games | 2018-12-10 | Paper |
| Formally Reasoning About Quality | 2018-08-02 | Paper |
| Automata Theory and Model Checking | 2018-07-20 | Paper |
| On relative and probabilistic finite counterability | 2018-04-12 | Paper |
| On the Complexity of Universality for Partially Ordered NFAs | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608660 | 2018-03-21 | Paper |
| Synthesis from component libraries with costs | 2018-02-09 | Paper |
| Latticed-LTL synthesis in the presence of noisy inputs | 2017-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357713 | 2017-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351957 | 2017-08-31 | Paper |
| Sensing as a complexity measure | 2017-08-31 | Paper |
| A parametrized analysis of algorithms on hierarchical graphs | 2017-08-31 | Paper |
| High-Quality Synthesis Against Stochastic Environments | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275380 | 2017-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275381 | 2017-07-13 | Paper |
| From linear time to branching time | 2017-07-12 | Paper |
| What causes a system to satisfy a specification? | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978510 | 2017-04-25 | Paper |
| Network-formation games with regular objectives | 2016-11-18 | Paper |
| Dynamic Resource Allocation Games | 2016-09-29 | Paper |
| Synthesis with rational environments | 2016-09-16 | Paper |
| On High-Quality Synthesis | 2016-07-25 | Paper |
| On the Capacity of Capacitated Automata | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3459475 | 2016-01-08 | Paper |
| Spanning the Spectrum from Safety to Liveness | 2016-01-08 | Paper |
| A Game-Theoretic Approach to Simulation of Data-Parameterized Systems | 2015-12-17 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2015-12-07 | Paper |
| Alternating-time temporal logic | 2015-12-07 | Paper |
| Inherent Vacuity in Lattice Automata | 2015-09-22 | Paper |
| Minimizing Deterministic Lattice Automata | 2015-09-17 | Paper |
| Erratum for “What causes a system to satisfy a specification?” | 2015-09-17 | Paper |
| Translating to Co-Büchi Made Tight, Unified, and Useful | 2015-09-17 | Paper |
| Temporal Specifications with Accumulative Values | 2015-09-17 | Paper |
| Parameterized Weighted Containment | 2015-09-17 | Paper |
| Stochastization of Weighted Automata | 2015-09-16 | Paper |
| Discounting in LTL | 2015-02-10 | Paper |
| Prime languages | 2015-01-30 | Paper |
| Reasoning about online algorithms with weighted automata | 2014-11-18 | Paper |
| From Reachability to Temporal Specifications in Cost-Sharing Games | 2014-09-26 | Paper |
| Synthesis from Component Libraries with Costs | 2014-09-15 | Paper |
| Weighted Safety | 2014-07-08 | Paper |
| A Framework for Ranking Vacuity Results | 2014-07-08 | Paper |
| An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications | 2014-07-08 | Paper |
| An abstraction-refinement framework for trigger querying | 2014-06-30 | Paper |
| Network-Formation Games with Regular Objectives | 2014-04-16 | Paper |
| Latticed-LTL Synthesis in the Presence of Noisy Inputs | 2014-04-16 | Paper |
| When does abstraction help? | 2014-04-14 | Paper |
| Rigorous approximated determinization of weighted automata | 2013-11-29 | Paper |
| Prime Languages | 2013-09-20 | Paper |
| Formalizing and Reasoning about Quality | 2013-08-07 | Paper |
| Nondeterminism in the Presence of a Diverse or Unknown Future | 2013-08-07 | Paper |
| Verification of Open Systems | 2013-06-18 | Paper |
| Branching-Depth Hierarchies | 2013-04-26 | Paper |
| Unifying B\"uchi Complementation Constructions | 2013-04-09 | Paper |
| Parameterized Weighted Containment | 2013-03-18 | Paper |
| Approximating Deterministic Lattice Automata | 2012-11-21 | Paper |
| Model Checking Systems and Specifications with Parameterized Atomic Propositions | 2012-11-21 | Paper |
| Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction | 2012-09-25 | Paper |
| Unifying Büchi Complementation Constructions. | 2012-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908872 | 2012-08-29 | Paper |
| \textit{Once} and \textit{for all} | 2012-08-17 | Paper |
| Coping with selfish on-going behaviors | 2012-05-24 | Paper |
| Improved model checking of hierarchical systems | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113724 | 2012-01-23 | Paper |
| Max and Sum Semantics for Alternating Weighted Automata | 2011-10-07 | Paper |
| Formal Analysis of Online Algorithms | 2011-10-07 | Paper |
| What’s Decidable about Weighted Automata? | 2011-10-07 | Paper |
| Minimizing Deterministic Lattice Automata | 2011-05-19 | Paper |
| Co-Büching Them All | 2011-05-19 | Paper |
| On Bounded Specifications | 2011-05-06 | Paper |
| Synthesis of Trigger Properties | 2011-01-07 | Paper |
| Coping with Selfish On-Going Behaviors | 2011-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060982 | 2010-12-13 | Paper |
| Promptness in ω-Regular Automata | 2010-10-04 | Paper |
| An Automata-Theoretic Approach to Infinite-State Systems | 2010-09-07 | Paper |
| Alternation Removal in Büchi Automata | 2010-09-07 | Paper |
| The Quest for a Tight Translation of Büchi to co-Büchi Automata | 2010-09-03 | Paper |
| Variable Automata over Infinite Alphabets | 2010-05-26 | Paper |
| Rational Synthesis | 2010-04-27 | Paper |
| LATTICED SIMULATION RELATIONS AND GAMES | 2010-04-22 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| Improved Model Checking of Hierarchical Systems | 2010-01-14 | Paper |
| From liveness to promptness | 2009-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396614 | 2009-09-19 | Paper |
| Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata | 2009-03-31 | Paper |
| Tightening the Exchange Rates Between Automata | 2009-03-05 | Paper |
| On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata | 2009-01-27 | Paper |
| Weak alternating automata are not that weak | 2008-12-21 | Paper |
| On the Construction of Fine Automata for Safety Properties | 2008-09-04 | Paper |
| On the Succinctness of Nondeterminism | 2008-09-04 | Paper |
| Latticed Simulation Relations and Games | 2008-07-03 | Paper |
| On Locally Checkable Properties | 2008-05-27 | Paper |
| An automata-theoretic approach to branching-time model checking | 2008-05-05 | Paper |
| Vacuity in Testing | 2008-04-24 | Paper |
| On Verifying Fault Tolerance of Distributed Protocols | 2008-04-11 | Paper |
| Lattice Automata | 2008-04-04 | Paper |
| Better Under-Approximation of Programs by Hiding Variables | 2008-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5447366 | 2008-03-06 | Paper |
| Concurrent reachability games | 2007-12-19 | Paper |
| From Liveness to Promptness | 2007-11-29 | Paper |
| Leaping Loops in the Presence of Abstraction | 2007-11-29 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Safraless Compositional Synthesis | 2007-09-05 | Paper |
| Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words | 2007-09-04 | Paper |
| Sanity Checks in Formal Verification | 2007-09-04 | Paper |
| Coverage metrics for temporal logic model checking | 2006-11-17 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| BÜCHI COMPLEMENTATION MADE TIGHTER | 2006-08-21 | Paper |
| TYPENESS FOR ω-REGULAR AUTOMATA | 2006-08-21 | Paper |
| On the universal and existential fragments of the \(\mu\)-calculus | 2006-04-28 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| Relating word and tree automata | 2005-12-29 | Paper |
| From complementation to certification | 2005-12-06 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692280 | 2005-09-28 | Paper |
| \(\omega\)-regular languages are testable with a constant number of queries | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817542 | 2004-09-24 | Paper |
| From pre-historic to post-modern symbolic model checking | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809076 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737196 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472441 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449213 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440425 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428305 | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417913 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417914 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411830 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708594 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804910 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542592 | 2003-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791853 | 2003-02-03 | Paper |
| Module checking | 2003-01-14 | Paper |
| Fair simulation | 2003-01-14 | Paper |
| On the complexity of verifying concurrent transition systems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536596 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536385 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551135 | 2002-09-04 | Paper |
| Model checking of safety properties | 2002-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769435 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769612 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754072 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494388 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518425 | 2000-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952307 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936149 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270071 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251063 | 1999-11-16 | Paper |
| Church's Problem Revisited | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259992 | 1999-09-08 | Paper |
| Augmenting branching temporal logics with existential quantification over atomic propositions | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218940 | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4356434 | 1997-11-26 | Paper |
| Branching-time temporal logic and tree automata | 1996-12-12 | Paper |
| Buy one, get one free!!! | 1996-11-17 | Paper |
