| Publication | Date of Publication | Type |
|---|
Fair \(\omega \)-regular games
| 2024-10-30 | Paper |
Symbolic solution of Emerson-Lei games for reactive synthesis
| 2024-10-30 | Paper |
A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Combinations of Qualitative Winning for Stochastic Parity Games
| 2023-02-03 | Paper |
Actions over core-closed knowledge bases
| 2022-12-07 | Paper |
Incorporating monitors in reactive synthesis without paying the price
| 2022-06-22 | Paper |
scientific article; zbMATH DE number 7356850 (Why is no real title available?)
| 2021-06-09 | Paper |
Fairness for Infinite-State Systems
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Finding recurrent sets with backward analysis and trace partitioning
| 2019-09-17 | Paper |
Temporal logic and fair discrete systems
Handbook of Model Checking | 2018-07-20 | Paper |
Verifying increasingly expressive temporal logics for infinite-state systems
Journal of the ACM | 2018-05-17 | Paper |
On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
| 2018-03-01 | Paper |
Equivalence of probabilistic \(\mu\)-calculus and p-automata
| 2017-08-22 | Paper |
Obligation Blackwell games and p-automata
Journal of Symbolic Logic | 2017-08-03 | Paper |
Safety verification of piecewise-deterministic Markov processes
Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Tractable probabilistic \(\mu\)-calculus that expresses probabilistic temporal logics
| 2017-01-24 | Paper |
Static analysis of parity games: alternating reachability under parity
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
The Rabin index of parity games: its complexity and approximation
Information and Computation | 2015-12-07 | Paper |
Synthesis of biological models from mutation experiments
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
SAT-based induction for temporal safety properties
| 2013-09-20 | Paper |
Fatal Attractors in Parity Games
Lecture Notes in Computer Science | 2013-03-18 | Paper |
The modal transition system control problem
FM 2012: Formal Methods | 2012-11-08 | Paper |
Synthesis of Reactive(1) designs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Effective synthesis of asynchronous systems from GR(1) specifications
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Dynamic Reactive Modules
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Proving stabilization of biological systems
Lecture Notes in Computer Science | 2011-02-15 | Paper |
From \textsc{mtl} to deterministic timed automata
Lecture Notes in Computer Science | 2010-09-10 | Paper |
An automata-theoretic approach to infinite-state systems
Time for Verification | 2010-09-07 | Paper |
Strategy logic
Information and Computation | 2010-06-25 | Paper |
Enhanced vacuity detection in linear temporal logic.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Bridging the gap between fair simulation and trace inclusion.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Fair equivalence relations
Lecture Notes in Computer Science | 2010-03-23 | Paper |
From liveness to promptness
Formal Methods in System Design | 2009-11-23 | Paper |
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2009-05-15 | Paper |
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Solving Games Without Determinization
Computer Science Logic | 2009-03-12 | Paper |
Inferring Network Invariants Automatically
Automated Reasoning | 2009-03-12 | Paper |
LTL Generalized Model Checking Revisited
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Strategy Logic
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
Formal Methods in Systems Biology | 2008-06-17 | Paper |
From Liveness to Promptness
Computer Aided Verification | 2007-11-29 | Paper |
From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
Logical Methods in Computer Science | 2007-11-15 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Generalized Parity Games
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Safraless Compositional Synthesis
Computer Aided Verification | 2007-09-05 | Paper |
Minimizing Generalized Büchi Automata
Computer Aided Verification | 2007-09-05 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Computational Methods in Systems Biology
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Bridging the gap between fair simulation and trace inclusion
Information and Computation | 2005-08-05 | Paper |
scientific article; zbMATH DE number 2080199 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1980931 (Why is no real title available?)
| 2003-09-15 | Paper |
From bidirectionality to alternation.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1903366 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1863182 (Why is no real title available?)
| 2003-02-03 | Paper |
scientific article; zbMATH DE number 1834680 (Why is no real title available?)
| 2002-11-25 | Paper |
