| Publication | Date of Publication | Type |
|---|
Verification of agent navigation in partially-known environments
Artificial Intelligence | 2022-06-01 | Paper |
Quantifying Bounds in Strategy Logic
| 2022-05-28 | Paper |
Optimal strategies in weighted limit games
| 2022-01-11 | Paper |
Equilibria for games with combined qualitative and quantitative objectives
Acta Informatica | 2021-12-15 | Paper |
Automatic structures
| 2021-11-12 | Paper |
scientific article; zbMATH DE number 7361821 (Why is no real title available?)
| 2021-06-22 | Paper |
A Myhill-Nerode theorem for automata with advice
| 2021-04-27 | Paper |
scientific article; zbMATH DE number 7297884 (Why is no real title available?)
| 2021-01-19 | Paper |
Verification of multi-agent systems with public actions against strategy logic
Artificial Intelligence | 2020-08-06 | Paper |
Parameterized model checking of synchronous distributed algorithms by abstraction
Lecture Notes in Computer Science | 2020-07-07 | Paper |
Model-checking graded computation-tree logic with finite path semantics
Theoretical Computer Science | 2020-01-16 | Paper |
CTL\(^\ast\) with graded path modalities
Information and Computation | 2018-09-27 | Paper |
Graded modalities in strategy logic
Information and Computation | 2018-06-14 | Paper |
Parameterized model checking of rendezvous systems
Distributed Computing | 2018-06-01 | Paper |
Automatic linear orders and trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Interpretations in trees with countably many branches
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
First-cycle games
Information and Computation | 2017-05-12 | Paper |
Model checking parameterised multi-token systems via the composition method
Automated Reasoning | 2016-09-05 | Paper |
On the Expressive Power of Communication Primitives in Parameterised Systems
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
On CTL* with Graded Path Modalities
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
Liveness of parameterized timed networks
Automata, Languages, and Programming | 2015-11-04 | Paper |
Parameterized Model Checking of Token-Passing Systems
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Parameterized model checking of rendezvous systems
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Alternating traps in Muller and parity games
Theoretical Computer Science | 2014-01-22 | Paper |
Cardinality and counting quantifiers on omega-automatic structures
| 2013-03-19 | Paper |
Order-invariant MSO is stronger than counting MSO in the finite
| 2013-03-19 | Paper |
How to travel between languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Automata-based presentations of infinite structures
| 2011-10-05 | Paper |
Automata Presenting Structures: A Survey of the Finite String Case
The Bulletin of Symbolic Logic | 2008-06-09 | Paper |
Automatic Structures: Richness and Limitations
Logical Methods in Computer Science | 2007-10-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
scientific article; zbMATH DE number 2040323 (Why is no real title available?)
| 2004-02-11 | Paper |
scientific article; zbMATH DE number 1747445 (Why is no real title available?)
| 2002-05-29 | Paper |
