| Publication | Date of Publication | Type |
|---|
| Learning deterministic visibly pushdown automata under accessible stack | 2024-08-06 | Paper |
| Deterministic weighted automata under partial observability | 2024-05-29 | Paper |
Approximate learning of limit-average automata
(available as arXiv preprint) | 2023-02-03 | Paper |
Long-Run Average Behavior of Vector Addition Systems with States
(available as arXiv preprint) | 2023-02-03 | Paper |
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
(available as arXiv preprint) | 2022-07-18 | Paper |
Learning infinite-word automata with loop-index queries
Artificial Intelligence | 2022-04-11 | Paper |
scientific article; zbMATH DE number 7407799 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407799 (Why is no real title available?) | 2021-10-08 | Paper |
| Non-deterministic Weighted Automata on Random Words | 2021-08-04 | Paper |
| Learning deterministic automata on infinite words | 2021-07-06 | Paper |
| Satisfiability vs. finite satisfiability in elementary modal logics | 2021-04-27 | Paper |
Satisfiability vs. finite satisfiability in elementary modal logics
(available as arXiv preprint) | 2021-04-27 | Paper |
Querying best paths in graph databases
(available as arXiv preprint) | 2020-11-25 | Paper |
Average stack cost of Büchi pushdown automata
(available as arXiv preprint) | 2020-11-25 | Paper |
Bidirectional nested weighted automata
(available as arXiv preprint) | 2020-05-27 | Paper |
Non-deterministic weighted automata evaluated over Markov chains
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Quantitative automata under probabilistic semantics
Logical Methods in Computer Science | 2019-08-13 | Paper |
Satisfiability versus Finite Satisfiability in Elementary Modal Logics
Fundamenta Informaticae | 2019-01-17 | Paper |
| Quantitative monitor automata | 2018-08-27 | Paper |
Nested weighted automata
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The target discounted-sum problem
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Quantitative automata under probabilistic semantics
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Nested weighted automata
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Nested weighted limit-average automata of bounded width
(available as arXiv preprint) | 2018-03-21 | Paper |
Edit distance for pushdown automata
(available as arXiv preprint) | 2017-10-12 | Paper |
On the decidability of elementary modal logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Decidable elementary modal logics
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Model measuring for hybrid systems
Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Quantitative fair simulation games
Information and Computation | 2017-05-12 | Paper |
Lipschitz robustness of finite-state transducers
(available as arXiv preprint) | 2017-04-25 | Paper |
| Elementary modal logics over transitive structures | 2017-02-02 | Paper |
Model measuring for discrete and hybrid systems
Nonlinear Analysis. Hybrid Systems | 2016-12-15 | Paper |
Lipschitz robustness of timed I/O systems
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Edit distance for pushdown automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
From model checking to model measuring
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
| Modal logics definable by universal three-variable formulas | 2012-08-31 | Paper |
\(E\)-unification with constants vs. general \(E\)-unification
Journal of Automated Reasoning | 2012-07-31 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
