| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7650300 (Why is no real title available?)
| 2023-02-03 | Paper |
The Reachability Problem for Petri Nets Is Not Elementary
Journal of the ACM | 2022-12-08 | Paper |
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559504 (Why is no real title available?)
| 2022-07-18 | Paper |
Leafy automata for higher-order concurrency
| 2021-10-18 | Paper |
When is containment decidable for probabilistic automata?
| 2021-07-28 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
The ideal view on Rackoff's coverability technique
Information and Computation | 2021-04-13 | Paper |
A lower bound for the coverability problem in acyclic pushdown VAS
Information Processing Letters | 2021-03-11 | Paper |
A pseudo-quasi-polynomial algorithm for mean-payoff parity games
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Succinct progress measures for solving parity games
| 2021-01-19 | Paper |
Timed pushdown automata and branching vector addition systems
| 2021-01-19 | Paper |
Perfect half space games
| 2021-01-19 | Paper |
Polynomial-space completeness of reachability for succinct branching VASS in dimension one
| 2020-05-27 | Paper |
The reachability problem for Petri nets is not elementary
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Binary reachability of timed-register pushdown automata and branching vector addition systems
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The complexity of coverability in \(\nu\)-Petri nets
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Reachability in two-dimensional unary vector addition systems with states is NL-complete
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Non-elementary complexities for branching VASS, MELL, and extensions
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
What makes Petri nets harder to verify: stack or data?
| 2018-03-26 | Paper |
A polynomial-time algorithm for reachability in branching VASS in dimension one
| 2017-12-19 | Paper |
The ideal view on Rackoff's coverability technique
Lecture Notes in Computer Science | 2017-10-27 | Paper |
Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Coverability trees for Petri nets with unordered data
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Contextual approximation and higher-order procedures
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Fixed-dimensional energy games are in pseudo-polynomial time
Automata, Languages, and Programming | 2015-11-04 | Paper |
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Safety alternating automata on data words
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Nonelementary complexities for branching VASS, MELL, and extensions
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Decidability of reachability for polymorphic systems with arrays: a complete classification
| 2013-10-02 | Paper |
Polymorphic systems with arrays, 2-counter machines and multiset rewriting
| 2013-10-02 | Paper |
Software model checking based on game semantics and CSP
| 2013-09-26 | Paper |
Zeno, Hercules and the Hydra: downward rational termination is Ackermannian
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences | 2013-02-21 | Paper |
The covering and boundedness problems for branching vector addition systems
| 2012-10-24 | Paper |
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters | 2012-03-27 | Paper |
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science | 2010-05-27 | Paper |
Nets with Tokens Which Carry Data
Petri Nets and Other Models of Concurrency – ICATPN 2007 | 2009-03-11 | Paper |
Nets with tokens which carry data
| 2009-02-12 | Paper |
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Safely Freezing LTL
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Model Checking Freeze LTL over One-Counter Automata
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation | 2007-02-19 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Communicating Sequential Processes. The First 25 Years
Lecture Notes in Computer Science | 2005-11-29 | Paper |
scientific article; zbMATH DE number 2061713 (Why is no real title available?)
| 2004-03-22 | Paper |
scientific article; zbMATH DE number 1759637 (Why is no real title available?)
| 2002-11-28 | Paper |
