| Publication | Date of Publication | Type |
|---|
Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
| 2024-12-06 | Paper |
Explorable automata
| 2024-09-25 | Paper |
Cyclic proofs for transfinite expressions
| 2024-04-10 | Paper |
Positive First-order Logic on Words and Graphs
Logical Methods in Computer Science | 2023-08-26 | Paper |
Cyclic Proofs and Jumping Automata
| 2023-02-03 | Paper |
Büchi Good-for-Games Automata Are Efficiently Recognizable
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559429 (Why is no real title available?)
| 2022-07-18 | Paper |
Coinductive algorithms for Büchi automata
Fundamenta Informaticae | 2021-10-25 | Paper |
Positive first-order logic on words
| 2021-01-06 | Paper |
Width of non-deterministic automata
| 2020-08-05 | Paper |
Kleene algebra with hypotheses
| 2020-01-28 | Paper |
Computing the width of non-deterministic automata
| 2020-01-03 | Paper |
Sensing as a complexity measure
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Eventually safe languages
| 2019-10-15 | Paper |
Coinductive algorithms for Büchi automata
| 2019-10-15 | Paper |
On finite domains in first-order linear temporal logic
| 2018-10-25 | Paper |
Two-way cost automata and cost logics over infinite trees
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Soundness in negotiations
| 2018-03-21 | Paper |
Varieties of Cost Functions
| 2018-01-24 | Paper |
Cost functions definable by min/max automata
| 2018-01-24 | Paper |
Soundness in negotiations
| 2018-01-23 | Paper |
Sensing as a complexity measure
| 2017-08-31 | Paper |
Stamina: stabilisation monoids in automata theory
| 2017-08-22 | Paper |
The sensing cost of monitoring and synthesis
| 2017-07-13 | Paper |
Regular sensing
| 2017-04-25 | Paper |
Deciding the weak definability of Büchi definable tree languages
| 2017-02-02 | Paper |
ACME: automata with counters, monoids and equivalence
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
On Determinisation of Good-for-Games Automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
Trading bounds for memory in games with counters
Automata, Languages, and Programming | 2015-11-04 | Paper |
Linear temporal logic for regular cost functions
Logical Methods in Computer Science | 2014-03-24 | Paper |
Nondeterminism in the presence of a diverse or unknown future
Automata, Languages, and Programming | 2013-08-07 | Paper |
On the Expressive Power of Cost Logics over Infinite Words
Automata, Languages, and Programming | 2012-11-01 | Paper |
Quasi-weak cost automata: a new variant of weakness
| 2012-08-31 | Paper |
Linear temporal logic for regular cost functions
| 2012-01-23 | Paper |
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
Annals of Pure and Applied Logic | 2011-12-12 | Paper |
Regular temporal cost functions
Automata, Languages and Programming | 2010-09-07 | Paper |
