| Publication | Date of Publication | Type |
|---|
| Robust identification of hybrid automata from noisy data | 2025-11-07 | Paper |
On Presburger arithmetic extended with non-unary counting quantifiers
Logical Methods in Computer Science | 2023-08-26 | Paper |
Constrained properties, semilinear systems, and Petri nets
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
| On the complexity of the linear-time μ-calculus for Petri Nets | 2022-12-09 | Paper |
| Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes | 2022-12-07 | Paper |
| On the path-width of integer linear programming | 2021-06-24 | Paper |
On the path-width of integer linear programming
(available as arXiv preprint) | 2021-06-24 | Paper |
Model-Checking Counting Temporal Logics on Flat Structures
(available as arXiv preprint) | 2020-05-27 | Paper |
Realizability of concurrent recursive programs
Formal Methods in System Design | 2018-11-15 | Paper |
Left-eigenvectors are certificates of the Orbit problem
(available as arXiv preprint) | 2018-10-23 | Paper |
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Automata, Languages and Programming | 2018-07-04 | Paper |
Emptiness of ordered multi-pushdown automata is 2ETIME-complete
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
On the path-width of integer linear programming
Information and Computation | 2017-03-16 | Paper |
Regular Transformations of Data Words Through Origin Information
Lecture Notes in Computer Science | 2016-06-10 | Paper |
On Presburger arithmetic extended with modulo counting quantifiers
Lecture Notes in Computer Science | 2015-10-01 | Paper |
A robust class of data languages and an application to learning
Logical Methods in Computer Science | 2015-01-15 | Paper |
Ordered navigation on multi-attributed data words
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Ordered navigation on multi-attributed data words
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Learning Transparent Data Automata
Application and Theory of Petri Nets and Concurrency | 2014-07-08 | Paper |
Forest automata for verification of heap manipulation
Formal Methods in System Design | 2014-03-28 | Paper |
| Abstract regular tree model checking | 2013-10-07 | Paper |
| Regular model checking using inference of regular languages | 2013-10-02 | Paper |
A fresh approach to learning register automata
Developments in Language Theory | 2013-06-28 | Paper |
| Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree | 2012-08-23 | Paper |
ON YEN'S PATH LOGIC FOR PETRI NETS
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Programs with lists are counter automata
Formal Methods in System Design | 2011-05-23 | Paper |
The downward-closure of Petri net languages
Automata, Languages and Programming | 2010-09-07 | Paper |
On the use of non-deterministic automata for Presburger arithmetic
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Verification of parametric concurrent systems with prioritized FIFO resource management.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Automata-based verification of programs with tree updates
Acta Informatica | 2010-02-05 | Paper |
On Yen’s Path Logic for Petri Nets
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Automatic Verification of Integer Array Programs
Computer Aided Verification | 2009-06-30 | Paper |
Realizability of Concurrent Recursive Programs
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Static Analysis | 2009-03-12 | Paper |
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Implementation and Applications of Automata | 2009-02-12 | Paper |
A Logic of Singly Indexed Arrays
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
Developments in Language Theory | 2008-10-30 | Paper |
Proving Termination of Tree Manipulating Programs
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
What Else Is Decidable about Integer Arrays?
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Verification of parametric concurrent systems with prioritised FIFO resource management
Formal Methods in System Design | 2008-04-11 | Paper |
Rewriting Systems with Data
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Programs with Lists Are Counter Automata
Computer Aided Verification | 2007-09-05 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2102702 (Why is no real title available?) | 2004-09-24 | Paper |
Automatic verification of recursive procedures with one integer parameter.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1848282 (Why is no real title available?) | 2003-01-01 | Paper |
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science | 2000-01-12 | Paper |
