| Publication | Date of Publication | Type |
|---|
| LambdaY-calculus with priorities | 2024-12-19 | Paper |
| Active learning for sound negotiations | 2024-12-06 | Paper |
| Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods | 2024-12-06 | Paper |
| Checking timed Büchi automata emptiness using the local-time semantics | 2024-08-13 | Paper |
| Distributed controller synthesis for deadlock avoidance | 2024-06-24 | Paper |
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
| Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems | 2022-08-12 | Paper |
Characterizing Consensus in the Heard-Of Model
(available as arXiv preprint) | 2022-07-18 | Paper |
Abstraction-based control synthesis using partial information
European Journal of Control | 2022-03-04 | Paper |
| Synthesis with finite automata | 2021-11-12 | Paper |
Leafy automata for higher-order concurrency
(available as arXiv preprint) | 2021-10-18 | Paper |
| Static analysis of deterministic negotiations | 2021-01-19 | Paper |
Static analysis of deterministic negotiations
(available as arXiv preprint) | 2021-01-19 | Paper |
Why liveness for timed automata is hard, and what we can do about it
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
The mu-calculus and Model Checking
Handbook of Model Checking | 2018-07-20 | Paper |
The diagonal problem for higher-order recursion schemes is decidable
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Why liveness for timed automata is hard, and what we can do about it | 2018-04-19 | Paper |
| Soundness in negotiations | 2018-03-21 | Paper |
Soundness in negotiations
(available as arXiv preprint) | 2018-01-23 | Paper |
| Deciding the topological complexity of Büchi languages | 2017-12-19 | Paper |
Monadic second order logic on tree-like structures
STACS 96 | 2017-11-16 | Paper |
| Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable | 2017-09-12 | Paper |
| A model for behavioural properties of higher-order programs | 2017-08-31 | Paper |
Ordered tree-pushdown systems
(available as arXiv preprint) | 2017-07-13 | Paper |
Alternating timed automata
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Better abstractions for timed automata
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Typing weak MSOL properties
Logical Methods in Computer Science | 2017-05-08 | Paper |
Distributed synthesis for acyclic architectures
(available as arXiv preprint) | 2017-04-25 | Paper |
Simply typed fixpoint calculus and collapsible pushdown automata
Mathematical Structures in Computer Science | 2017-04-03 | Paper |
| Evaluation is MSOL-compatible | 2017-02-21 | Paper |
Reachability for dynamic parametric processes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Better abstractions for timed automata
Information and Computation | 2016-11-18 | Paper |
A note on monitors and Büchi automata
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Typing weak MSOL properties
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Using models to model-check recursive schemes
Logical Methods in Computer Science | 2015-08-25 | Paper |
Krivine machines and higher-order schemes
Information and Computation | 2014-11-28 | Paper |
Asynchronous Games over Tree Architectures
Automata, Languages, and Programming | 2013-08-07 | Paper |
Using models to model-check recursive schemes
Lecture Notes in Computer Science | 2013-06-28 | Paper |
Deciding low levels of tree-automata hierarchy
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Recursive schemes, Krivine machines, and collapsible pushdown automata
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Efficient emptiness check for timed Büchi automata
Formal Methods in System Design | 2012-09-27 | Paper |
Simple Models for Recursive Schemes
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Wreath products of forest algebras, with applications to tree logics
Logical Methods in Computer Science | 2012-09-25 | Paper |
Weak alternating timed automata
Logical Methods in Computer Science | 2012-09-25 | Paper |
Using non-convex approximations for efficient analysis of timed automata
(available as arXiv preprint) | 2012-08-31 | Paper |
An alternate proof of Statman's finite completeness theorem
Information Processing Letters | 2012-07-25 | Paper |
Krivine machines and higher-order schemes
Automata, Languages and Programming | 2011-07-07 | Paper |
Automata and games for synthesis
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
| scientific article; zbMATH DE number 5872386 (Why is no real title available?) | 2011-03-30 | Paper |
| Nondeterministic controllers of nondeterministic processes | 2011-03-30 | Paper |
Choice functions and well-orderings over the infinite binary tree
Central European Journal of Mathematics | 2010-11-22 | Paper |
Synthesis: words and traces
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Optimal Zielonka-type construction of deterministic asynchronous automata
Automata, Languages and Programming | 2010-09-07 | Paper |
Automata for the modal \(\mu \)-calculus and related results
Lecture Notes in Computer Science | 2010-06-17 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
| scientific article; zbMATH DE number 5587278 (Why is no real title available?) | 2009-07-27 | Paper |
Weak Alternating Timed Automata
Automata, Languages and Programming | 2009-07-14 | Paper |
Minimizing Variants of Visibly Pushdown Automata
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A lower bound on web services composition
Logical Methods in Computer Science | 2008-08-07 | Paper |
Third-order Idealized Algol with iteration is decidable
Theoretical Computer Science | 2008-03-05 | Paper |
Positional Determinacy of Games with Infinitely Many Priorities
Logical Methods in Computer Science | 2007-10-11 | Paper |
A Lower Bound on Web Services Composition
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation | 2006-10-10 | Paper |
Characterizing EF and EX tree logics
Theoretical Computer Science | 2006-09-13 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
AN NP-COMPLETE FRAGMENT OF LTL
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Difficult configurations -- on the complexity of LTrL
Formal Methods in System Design | 2005-05-17 | Paper |
| scientific article; zbMATH DE number 2080197 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1916675 (Why is no real title available?) | 2004-02-22 | Paper |
A gap property of deterministic tree languages.
Theoretical Computer Science | 2003-08-17 | Paper |
Complexity of weak acceptance conditions in tree automata.
Information Processing Letters | 2003-01-21 | Paper |
Pushdown processes: Games and model-checking
Information and Computation | 2003-01-14 | Paper |
Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
Information and Computation | 2003-01-14 | Paper |
Monadic second-order logic on tree-like structures
Theoretical Computer Science | 2002-07-31 | Paper |
Permissive strategies: from parity games to safety games
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
Permissive strategies: from parity games to safety games
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1392287 (Why is no real title available?) | 2000-01-24 | Paper |
Monadic second-order logic, graph coverings and unfoldings of transition systems
Annals of Pure and Applied Logic | 1999-11-03 | Paper |
| scientific article; zbMATH DE number 1223711 (Why is no real title available?) | 1999-02-14 | Paper |
| scientific article; zbMATH DE number 1136080 (Why is no real title available?) | 1998-04-01 | Paper |
A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
The Bulletin of Symbolic Logic | 1997-08-19 | Paper |
Games for the \(\mu\)-calculus
Theoretical Computer Science | 1997-02-27 | Paper |
Gentzen-type axiomatization for PAL
Theoretical Computer Science | 1993-12-12 | Paper |
| scientific article; zbMATH DE number 18645 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 19783 (Why is no real title available?) | 1992-06-26 | Paper |
