| Publication | Date of Publication | Type |
|---|
| Complexity of qualitative timeline-based planning | 2023-11-02 | Paper |
| Reachability in Concurrent Uninterpreted Programs. | 2023-02-03 | Paper |
Synchronization of 1-way connected processors
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Visibly pushdown modular games | 2021-06-24 | Paper |
Visibly pushdown modular games
(available as arXiv preprint) | 2021-06-24 | Paper |
Reachability of scope-bounded multistack pushdown systems
Information and Computation | 2020-12-15 | Paper |
| Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable | 2017-09-12 | Paper |
Deterministic generators and games for LTL fragments
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Visibly pushdown modular games
Information and Computation | 2017-03-16 | Paper |
| Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width | 2017-01-26 | Paper |
Scope-bounded pushdown languages
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
A general modular synthesis problem for pushdown systems
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Parametric metric interval temporal logic
Theoretical Computer Science | 2014-12-16 | Paper |
A unifying approach for multistack pushdown automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Scope-bounded pushdown languages
Developments in Language Theory | 2014-10-14 | Paper |
Modular synthesis with open components
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Automata-theoretic decision of timed games
Theoretical Computer Science | 2013-12-10 | Paper |
A Temporal Logic for Multi-threaded Programs
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Reachability of multistack pushdown systems with scope-bounded matching relations
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Parametric Metric Interval Temporal Logic
Language and Automata Theory and Applications | 2010-05-26 | Paper |
The language theory of bounded context-switching
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Playing games with boxes and diamonds.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design | 2009-12-02 | Paper |
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
Computer Aided Verification | 2009-06-30 | Paper |
Deterministic finite automata with recursive calls and DPDAs
Information Processing Letters | 2009-04-28 | Paper |
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic | 2008-12-21 | Paper |
An Infinite Automaton Characterization of Double Exponential Time
Computer Science Logic | 2008-11-20 | Paper |
Verification of scope-dependent hierarchical state machines
Information and Computation | 2008-10-08 | Paper |
Verification of well-formed communicating recursive state machines
Theoretical Computer Science | 2008-09-16 | Paper |
On the Membership Problem for Visibly Pushdown Languages
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Context-Bounded Analysis of Concurrent Queue Systems
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
On the Complexity of Ltl Model-Checking of Recursive State Machines
Automata, Languages and Programming | 2007-11-28 | Paper |
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design | 2007-11-28 | Paper |
Decision Problems for Lower/Upper Bound Parametric Timed Automata
Automata, Languages and Programming | 2007-11-28 | Paper |
THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Different time solutions for the firing squad synchronization problem on basic grid networks
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Different time solutions for the firing squad synchronization problem on basic grid networks
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Different time solutions for the firing squad synchronization problem on basic grid networks
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Modular strategies for recursive game graphs
Theoretical Computer Science | 2006-04-28 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Theoretical Aspects of Computing - ICTAC 2004
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science | 2005-04-06 | Paper |
Polyhedral flows in hybrid automata
Formal Methods in System Design | 2004-09-09 | Paper |
| scientific article; zbMATH DE number 2086509 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086519 (Why is no real title available?) | 2004-08-11 | Paper |
Optimal paths in weighted timed automata
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2080198 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2038754 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1956593 (Why is no real title available?) | 2003-07-30 | Paper |
Finite automata on timed \(\omega\)-trees
Theoretical Computer Science | 2003-07-01 | Paper |
| scientific article; zbMATH DE number 1869612 (Why is no real title available?) | 2003-03-24 | Paper |
Automata-based Representations for Infinite Graphs
RAIRO - Theoretical Informatics and Applications | 2002-11-17 | Paper |
Automata-based Representations for Infinite Graphs
RAIRO - Theoretical Informatics and Applications | 2002-11-17 | Paper |
Automata-based Representations for Infinite Graphs
RAIRO - Theoretical Informatics and Applications | 2002-11-17 | Paper |
| scientific article; zbMATH DE number 1794360 (Why is no real title available?) | 2002-09-03 | Paper |
Timed tree automata with an application to temporal logic.
Acta Informatica | 2002-08-14 | Paper |
| scientific article; zbMATH DE number 1738668 (Why is no real title available?) | 2002-05-07 | Paper |
A compositional approach to synchronize two-dimensional networks of processors
RAIRO. Theoretical Informatics and Applications | 2002-01-21 | Paper |
A compositional approach to synchronize two-dimensional networks of processors
RAIRO. Theoretical Informatics and Applications | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1405643 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1303058 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1222592 (Why is no real title available?) | 1999-07-05 | Paper |
| scientific article; zbMATH DE number 1192313 (Why is no real title available?) | 1998-11-09 | Paper |
| scientific article; zbMATH DE number 919839 (Why is no real title available?) | 1997-01-05 | Paper |
