| Publication | Date of Publication | Type |
|---|
| Alternating-time temporal logic | 2026-05-21 | Paper |
| Perspective games with notifications | 2026-03-23 | Paper |
A hierarchy of nondeterminism
Logical Methods in Computer Science | 2026-02-13 | Paper |
Monotonicity characterizations of regular languages
Information and Computation | 2025-12-15 | Paper |
| Concurrent reachability games | 2025-10-29 | Paper |
Variable automata over infinite alphabets
Formal Methods in System Design | 2025-10-21 | Paper |
Synthesis with privacy against an observer
Logical Methods in Computer Science | 2025-09-25 | Paper |
| Monotonicity characterizations of regular languages | 2025-07-28 | Paper |
| Games with trading of control | 2025-06-26 | Paper |
| Modular model checking | 2025-03-19 | Paper |
| Alternating-time temporal logic | 2025-03-19 | Paper |
| Perspective games | 2024-12-19 | Paper |
| On semantically-deterministic automata | 2024-11-14 | Paper |
| Synthesis with privacy against an observer | 2024-10-30 | Paper |
| Synthesis of privacy-preserving systems | 2024-09-12 | Paper |
| Energy games with resource-bounded environments | 2024-08-13 | Paper |
| CONCUR test-of-time award 2022 (invited paper) | 2024-08-13 | Paper |
Perspective games
ACM Transactions on Computational Logic | 2024-04-26 | Paper |
The complexity of LTL rational synthesis
ACM Transactions on Computational Logic | 2024-04-25 | Paper |
| The complexity of LTL rational synthesis | 2024-01-23 | Paper |
| scientific article; zbMATH DE number 7770050 (Why is no real title available?) | 2023-11-23 | Paper |
Lazy regular sensing
Theoretical Computer Science | 2023-08-18 | Paper |
A Hierarchy of Nondeterminism
(available as arXiv preprint) | 2023-08-08 | Paper |
Reasoning about Quality and Fuzziness of Strategic Behaviors
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
A space-efficient on-the-fly algorithm for real-time model checking
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Minimization of automata for liveness languages
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
On the complexity of verifying concurrent transition systems
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Fair simulation
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
| scientific article; zbMATH DE number 7650823 (Why is no real title available?) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7649933 (Why is no real title available?) | 2023-02-03 | Paper |
| Lazy regular sensing | 2023-01-18 | Paper |
Timed network games
Information and Computation | 2023-01-12 | Paper |
Multi-Valued Reasoning about Reactive Systems
Foundations and Trends® in Theoretical Computer Science | 2023-01-11 | Paper |
On (I/O)-Aware Good-For-Games Automata
1517.68186 | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7577580 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577580 (Why is no real title available?) | 2022-08-30 | Paper |
| Quantitative assume guarantee synthesis | 2022-08-12 | Paper |
| Minimizing GFG Transition-Based Automata | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559422 (Why is no real title available?) | 2022-07-18 | Paper |
| On Repetition Languages | 2022-07-18 | Paper |
Certifying DFA bounds for recognition and separation
(available as arXiv preprint) | 2022-06-22 | Paper |
| scientific article; zbMATH DE number 7455749 (Why is no real title available?) | 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455749 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-11 | Paper |
What's decidable about weighted automata?
Information and Computation | 2022-01-06 | Paper |
| Verification | 2021-11-12 | Paper |
Certifying inexpressibility
(available as arXiv preprint) | 2021-10-18 | Paper |
| Spanning-tree games | 2021-08-04 | Paper |
Timed network games with clocks
(available as arXiv preprint) | 2021-08-04 | Paper |
| The unfortunate-flow problem | 2021-07-28 | Paper |
| Mutually accepting capacitated automata | 2021-07-14 | Paper |
| Games with full, longitudinal, and transverse observability | 2021-07-06 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2021-06-09 | Paper |
| Timed vacuity | 2021-05-04 | Paper |
Good-enough synthesis
(available as arXiv preprint) | 2021-02-09 | Paper |
| Flow games | 2020-11-25 | Paper |
How deterministic are good-for-games automata?
(available as arXiv preprint) | 2020-11-25 | Paper |
Hierarchical network formation games
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
On synthesis of specifications with arithmetic
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| Properties and utilization of capacitated automata (invited talk) | 2020-07-19 | Paper |
| Flow logic | 2020-05-27 | Paper |
| Timed network games | 2020-05-26 | Paper |
Dynamic resource allocation games
Theoretical Computer Science | 2020-01-22 | Paper |
Capacitated automata and systems
Information and Computation | 2019-12-18 | Paper |
A Parametrized Analysis of Algorithms on Hierarchical Graphs
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Sensing as a complexity measure
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Flow logic
(available as arXiv preprint) | 2019-11-26 | Paper |
LTL with arithmetic and its applications in reasoning about hierarchical systems
EPiC Series in Computing | 2019-07-04 | Paper |
Playing with the Maximum-Flow Problem
EPiC Series in Computing | 2019-07-04 | Paper |
Alternating Reachability Games with Behavioral and Revenue Objectives
EPiC Series in Computing | 2019-07-04 | Paper |
| Reasoning about online algorithms with weighted automata | 2019-05-06 | Paper |
Spanning the spectrum from safety to liveness
Acta Informatica | 2018-12-12 | Paper |
An abstraction-refinement methodology for reasoning about network games
Games | 2018-12-10 | Paper |
Formally reasoning about quality
Journal of the ACM | 2018-08-02 | Paper |
Automata theory and model checking
Handbook of Model Checking | 2018-07-20 | Paper |
On relative and probabilistic finite counterability
Formal Methods in System Design | 2018-04-12 | Paper |
| On the Complexity of Universality for Partially Ordered NFAs | 2018-03-21 | Paper |
Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
(available as arXiv preprint) | 2018-03-21 | Paper |
Synthesis from component libraries with costs
Theoretical Computer Science | 2018-02-09 | Paper |
Latticed-LTL synthesis in the presence of noisy inputs
Discrete Event Dynamic Systems | 2017-11-10 | Paper |
| Repairing multi-player games | 2017-09-12 | Paper |
| A parametrized analysis of algorithms on hierarchical graphs | 2017-08-31 | Paper |
| On relative and probabilistic finite counterability | 2017-08-31 | Paper |
| Sensing as a complexity measure | 2017-08-31 | Paper |
High-Quality Synthesis Against Stochastic Environments
(available as arXiv preprint) | 2017-07-19 | Paper |
| Congestion games with multisets of resources and applications in synthesis | 2017-07-13 | Paper |
| The sensing cost of monitoring and synthesis | 2017-07-13 | Paper |
From linear time to branching time
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
What causes a system to satisfy a specification?
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Regular sensing | 2017-04-25 | Paper |
Network-formation games with regular objectives
Information and Computation | 2016-11-18 | Paper |
Dynamic resource allocation games
Algorithmic Game Theory | 2016-09-29 | Paper |
Synthesis with rational environments
Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
On high-quality synthesis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On the capacity of capacitated automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Spanning the Spectrum from Safety to Liveness
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
| scientific article; zbMATH DE number 6527944 (Why is no real title available?) | 2016-01-08 | Paper |
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Alternating-time temporal logic
Journal of the ACM | 2015-12-07 | Paper |
Profile trees for Büchi word automata, with application to determinization
Information and Computation | 2015-12-07 | Paper |
Inherent vacuity in lattice automata
Fields of Logic and Computation II | 2015-09-22 | Paper |
Erratum for “What causes a system to satisfy a specification?”
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Translating to co-Büchi made tight, unified, and useful
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Temporal specifications with accumulative values
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Parameterized weighted containment
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Minimizing deterministic lattice automata
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Stochastization of weighted automata
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Discounting in LTL
Tools and Algorithms for the Construction and Analysis of Systems | 2015-02-10 | Paper |
Prime languages
Information and Computation | 2015-01-30 | Paper |
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms | 2014-11-18 | Paper |
From reachability to temporal specifications in cost-sharing games
Automated Reasoning | 2014-09-26 | Paper |
Synthesis from component libraries with costs
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
An automata-theoretic approach to reasoning about parameterized systems and specifications
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
A Framework for Ranking Vacuity Results
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Weighted safety
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
An abstraction-refinement framework for trigger querying
Formal Methods in System Design | 2014-06-30 | Paper |
Network-formation games with regular objectives
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Latticed-LTL synthesis in the presence of noisy inputs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
When does abstraction help?
Information Processing Letters | 2014-04-14 | Paper |
Rigorous approximated determinization of weighted automata
Theoretical Computer Science | 2013-11-29 | Paper |
Prime languages
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Formalizing and Reasoning about Quality
Automata, Languages, and Programming | 2013-08-07 | Paper |
Nondeterminism in the presence of a diverse or unknown future
Automata, Languages, and Programming | 2013-08-07 | Paper |
Verification of Open Systems
Interactive Computation | 2013-06-18 | Paper |
Branching-depth hierarchies
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Unifying Büchi complementation constructions
Logical Methods in Computer Science | 2013-04-09 | Paper |
Parameterized Weighted Containment
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Model checking systems and specifications with parameterized atomic propositions
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Approximating deterministic lattice automata
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Making weighted containment feasible: a heuristic based on simulation and abstraction
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Unifying Büchi complementation constructions | 2012-09-18 | Paper |
Unifying Büchi complementation constructions
(available as arXiv preprint) | 2012-09-18 | Paper |
| Parityizing Rabin and Streett | 2012-08-29 | Paper |
\textit{Once} and \textit{for all}
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Coping with selfish on-going behaviors
Information and Computation | 2012-05-24 | Paper |
Improved model checking of hierarchical systems
Information and Computation | 2012-05-24 | Paper |
| Temporal synthesis for bounded systems and environments | 2012-01-23 | Paper |
What's decidable about weighted automata?
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Max and sum semantics for alternating weighted automata
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Formal Analysis of Online Algorithms
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Minimizing deterministic lattice automata
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Co-Büching them all
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
On bounded specifications
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Coping with selfish on-going behaviors
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Synthesis of Trigger Properties
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
| Multi-valued automata and their applications | 2010-12-13 | Paper |
Promptness in \(\omega \)-regular automata
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
An automata-theoretic approach to infinite-state systems
Time for Verification | 2010-09-07 | Paper |
Alternation removal in Büchi automata
Automata, Languages and Programming | 2010-09-07 | Paper |
The quest for a tight translation of Büchi to co-Büchi automata
Fields of Logic and Computation | 2010-09-03 | Paper |
Variable automata over infinite alphabets
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Rational synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Latticed simulation relations and games
International Journal of Foundations of Computer Science | 2010-04-22 | Paper |
Fair equivalence relations
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2010-02-05 | Paper |
On complementing nondeterministic Büchi automata
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Improved model checking of hierarchical systems
Lecture Notes in Computer Science | 2010-01-14 | Paper |
From liveness to promptness
Formal Methods in System Design | 2009-11-23 | Paper |
| scientific article; zbMATH DE number 5605116 (Why is no real title available?) | 2009-09-19 | Paper |
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Tightening the Exchange Rates Between Automata
Computer Science Logic | 2009-03-05 | Paper |
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Weak alternating automata are not that weak
ACM Transactions on Computational Logic | 2008-12-21 | Paper |
On the Construction of Fine Automata for Safety Properties
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
On the Succinctness of Nondeterminism
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Latticed Simulation Relations and Games
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
On Locally Checkable Properties
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
An automata-theoretic approach to branching-time model checking
Journal of the ACM | 2008-05-05 | Paper |
Vacuity in Testing
Tests and Proofs | 2008-04-24 | Paper |
On Verifying Fault Tolerance of Distributed Protocols
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Lattice Automata
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Better Under-Approximation of Programs by Hiding Variables
Lecture Notes in Computer Science | 2008-04-04 | Paper |
| Automata on infinite words and their applications in formal verification | 2008-03-06 | Paper |
Concurrent reachability games
Theoretical Computer Science | 2007-12-19 | Paper |
Leaping Loops in the Presence of Abstraction
Computer Aided Verification | 2007-11-29 | Paper |
From Liveness to Promptness
Computer Aided Verification | 2007-11-29 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Safraless Compositional Synthesis
Computer Aided Verification | 2007-09-05 | Paper |
Sanity Checks in Formal Verification
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Coverage metrics for temporal logic model checking
Formal Methods in System Design | 2006-11-17 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
BÜCHI COMPLEMENTATION MADE TIGHTER
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
TYPENESS FOR ω-REGULAR AUTOMATA
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
On the universal and existential fragments of the \(\mu\)-calculus
Theoretical Computer Science | 2006-04-28 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Relating word and tree automata
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
From complementation to certification
Theoretical Computer Science | 2005-12-06 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
| scientific article; zbMATH DE number 2209335 (Why is no real title available?) | 2005-09-28 | Paper |
\(\omega\)-regular languages are testable with a constant number of queries
Theoretical Computer Science | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2102704 (Why is no real title available?) | 2004-09-24 | Paper |
From pre-historic to post-modern symbolic model checking
Formal Methods in System Design | 2004-09-09 | Paper |
| scientific article; zbMATH DE number 2090317 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086659 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080199 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2038748 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2019622 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 1980931 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1956572 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1956573 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1948169 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1929959 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1903366 (Why is no real title available?) | 2003-05-01 | Paper |
| scientific article; zbMATH DE number 1775458 (Why is no real title available?) | 2003-02-19 | Paper |
| scientific article; zbMATH DE number 1863182 (Why is no real title available?) | 2003-02-03 | Paper |
On the complexity of verifying concurrent transition systems
Information and Computation | 2003-01-14 | Paper |
Module checking
Information and Computation | 2003-01-14 | Paper |
Fair simulation
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759605 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1759436 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1796124 (Why is no real title available?) | 2002-09-04 | Paper |
Model checking of safety properties
Formal Methods in System Design | 2002-04-04 | Paper |
| scientific article; zbMATH DE number 1701778 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1701356 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1670767 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1487861 (Why is no real title available?) | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1536557 (Why is no real title available?) | 2000-11-28 | Paper |
| scientific article; zbMATH DE number 1444727 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1392310 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1361134 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1304332 (Why is no real title available?) | 1999-11-16 | Paper |
Church's Problem Revisited
The Bulletin of Symbolic Logic | 1999-09-22 | Paper |
Church's Problem Revisited
The Bulletin of Symbolic Logic | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1332671 (Why is no real title available?) | 1999-09-08 | Paper |
Augmenting branching temporal logics with existential quantification over atomic propositions
Journal Of Logic And Computation | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 1223629 (Why is no real title available?) | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 1069482 (Why is no real title available?) | 1997-11-26 | Paper |
Branching-time temporal logic and tree automata
Information and Computation | 1996-12-12 | Paper |
Buy one, get one free!!!
Journal Of Logic And Computation | 1996-11-17 | Paper |
