| Publication | Date of Publication | Type |
|---|
On the satisfiability of local first-order logics with data
Logical Methods in Computer Science | 2024-09-04 | Paper |
On the existential fragments of local first-order logics with data
| 2024-02-08 | Paper |
scientific article; zbMATH DE number 7799617 (Why is no real title available?)
| 2024-02-05 | Paper |
scientific article; zbMATH DE number 7559502 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7438567 (Why is no real title available?)
| 2021-12-03 | Paper |
Parameterized verification of algorithms for oblivious robots on a ring
Formal Methods in System Design | 2021-02-08 | Paper |
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
| 2020-05-27 | Paper |
Model-Checking Counting Temporal Logics on Flat Structures
| 2020-05-27 | Paper |
The complexity of flat freeze LTL
| 2020-05-27 | Paper |
The complexity of flat freeze LTL
| 2019-11-26 | Paper |
How hard is it to verify flat affine counter systems with the finite monoid property?
| 2018-10-25 | Paper |
Equivalence between model-checking flat counter systems and Presburger arithmetic
Theoretical Computer Science | 2018-06-05 | Paper |
Reachability in networks of register protocols under stochastic schedulers
| 2017-12-19 | Paper |
Distributed local strategies in broadcast networks
| 2017-09-12 | Paper |
Adding data registers to parameterized networks with broadcast
Fundamenta Informaticae | 2017-03-16 | Paper |
On the complexity of parameterized reachability in reconfigurable broadcast networks
| 2017-01-26 | Paper |
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Parameterized verification of time-sensitive models of ad hoc network protocols
Theoretical Computer Science | 2015-12-15 | Paper |
Equivalence between model-checking flat counter systems and Presburger arithmetic
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Taming past LTL and flat counter systems
Information and Computation | 2015-06-01 | Paper |
Reachability in timed counter systems
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Parameterized verification of broadcast networks of register automata
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Playing with probabilities in reconfigurable broadcast networks
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Solving parity games on integer vectors
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
On the Complexity of Verifying Regular Properties on Flat Counter Systems,
Automata, Languages, and Programming | 2013-08-07 | Paper |
Taming past LTL and flat counter systems
Automated Reasoning | 2012-09-05 | Paper |
On the Verification of Timed Ad Hoc Networks
Lecture Notes in Computer Science | 2011-10-07 | Paper |
On the power of cliques in the parameterized verification of ad hoc networks
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Parameterized verification of ad hoc networks
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science | 2010-05-27 | Paper |
When model-checking freeze LTL over counter machines becomes decidable
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Mixing coverability and reachability to analyze VASS with one zero-test
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Towards Model-Checking Programs with Lists
Infinity in Logic and Computation | 2009-11-12 | Paper |
Weak Time Petri Nets Strike Back!
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Reversal-Bounded Counter Machines Revisited
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Model Checking Freeze LTL over One-Counter Automata
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
From Time Petri Nets to Timed Automata: An Untimed Approach
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
