| Publication | Date of Publication | Type |
|---|
Deciding emptiness for constraint automata on strings with the prefix and suffix order
| 2024-08-06 | Paper |
First steps towards taming description logics with strings
| 2024-05-29 | Paper |
The containment problem for unambiguous register automata
| 2022-07-18 | Paper |
The containment problem for unambiguous register automata and unambiguous timed automata
Theory of Computing Systems | 2021-08-05 | Paper |
On the expressiveness of TPTL and MTL over \(\omega\)-data words
| 2021-06-22 | Paper |
MTL-model checking of one-clock parametric timed automata is undecidable
| 2021-06-22 | Paper |
scientific article; zbMATH DE number 7297846 (Why is no real title available?)
| 2021-01-19 | Paper |
Computing branching distances with quantitative games
Theoretical Computer Science | 2020-11-06 | Paper |
The complexity of flat freeze LTL
| 2020-05-27 | Paper |
MTL and TPTL for One-Counter Machines
ACM Transactions on Computational Logic | 2020-02-14 | Paper |
Computing branching distances using quantitative games
| 2019-12-12 | Paper |
The complexity of flat freeze LTL
| 2019-11-26 | Paper |
Effective definability of the reachability relation in timed automata
Information Processing Letters | 2019-11-21 | Paper |
Synchronizing data words for register automata
ACM Transactions on Computational Logic | 2019-07-04 | Paper |
Synchronizing Data Words for Register Automata
| 2018-03-21 | Paper |
Path checking for MTL and TPTL over data words
Logical Methods in Computer Science | 2017-10-12 | Paper |
An algebraic approach to energy problems. II: The algebra of energy functions
Acta Cybernetica | 2017-08-25 | Paper |
An algebraic approach to energy problems. I: \(^*\)-continuous Kleene \(\omega\)-algebras
Acta Cybernetica | 2017-08-25 | Paper |
Path checking for MTL and TPTL over data words
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Verification for Timed Automata extended with Unbounded Discrete Data Structures
Logical Methods in Computer Science | 2015-10-29 | Paper |
Verification for timed automata extended with unbounded discrete data structures
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Kleene algebras and semimodules for energy problems
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Parameterized model checking of weighted networks
Theoretical Computer Science | 2014-04-29 | Paper |
Satisfiability for MTL and TPTL over non-monotonic data words
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Recognizability of the support of recognizable series over the semiring of the integers is undecidable
Information Processing Letters | 2013-03-28 | Paper |
Model Checking Metric Temporal Logic over Automata with One Counter
Language and Automata Theory and Applications | 2013-03-18 | Paper |
MSO logics for weighted timed automata
Formal Methods in System Design | 2011-06-30 | Paper |
On the Interval-Bound Problem for Weighted Timed Automata
Language and Automata Theory and Applications | 2011-06-03 | Paper |
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science | 2011-03-14 | Paper |
Kleene-Schützenberg and Büchi theorems for weighted timed automata.
| 2010-07-05 | Paper |
On the supports of recognizable timed series
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Weighted Timed MSO Logics
Developments in Language Theory | 2009-07-07 | Paper |
Universality analysis for one-clock timed automata
| 2009-02-10 | Paper |
Zone-Based Universality Analysis for Single-Clock Timed Automata
Lecture Notes in Computer Science | 2008-07-01 | Paper |
A Kleene-Schützenberger Theorem for Weighted Timed Automata
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
