| Publication | Date of Publication | Type |
|---|
| Regular model checking for systems with effectively regular reachability relation | 2026-08-05 | Paper |
A resolution-based interactive proof system for UNSAT
Logical Methods in Computer Science | 2026-05-29 | Paper |
Undecidability of the emptiness problem for weak models of distributed computing
Theoretical Computer Science | 2026-02-27 | Paper |
| Validity of contextual formulas | 2026-02-10 | Paper |
| Computing inductive invariants of regular abstraction frameworks | 2026-02-10 | Paper |
Efficient normalization of linear temporal logic
Journal of the ACM | 2025-06-27 | Paper |
| Geometry of reachability sets of vector addition systems | 2025-06-26 | Paper |
Regular model checking upside-down: an invariant-based approach
Logical Methods in Computer Science | 2025-01-31 | Paper |
| Abduction of trap invariants in parameterized systems | 2024-12-06 | Paper |
| Black-box testing liveness properties of partially observable stochastic systems | 2024-11-14 | Paper |
| A resolution-based interactive proof system for UNSAT | 2024-10-30 | Paper |
| Regular model checking upside-down: an invariant-based approach | 2024-08-13 | Paper |
Decision Power of Weak Asynchronous Models of Distributed Computing
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Lower bounds on the state complexity of population protocols
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Separators in Continuous Petri Nets
Logical Methods in Computer Science | 2024-03-11 | Paper |
| scientific article; zbMATH DE number 7799580 (Why is no real title available?) | 2024-02-05 | Paper |
| Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms | 2024-02-01 | Paper |
Parameterized Analysis of Immediate Observation Petri Nets
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
Separators in continuous Petri nets
Lecture Notes in Computer Science | 2024-01-23 | Paper |
The asynchronous committee meeting problem
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Fast and succinct population protocols for Presburger arithmetic
Journal of Computer and System Sciences | 2024-01-04 | Paper |
| Automata theory. An algorithmic approach | 2023-11-24 | Paper |
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
Logical Methods in Computer Science | 2023-10-23 | Paper |
Lower bounds on the state complexity of population protocols
Distributed Computing | 2023-09-11 | Paper |
| scientific article; zbMATH DE number 7730607 (Why is no real title available?) | 2023-08-21 | Paper |
A simple rewrite system for the normalization of linear temporal logic
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Reachability analysis of pushdown automata: Application to model-checking
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Population protocols: beyond runtime analysis
(available as arXiv preprint) | 2023-03-31 | Paper |
Succinct Population Protocols for Presburger Arithmetic
(available as arXiv preprint) | 2023-02-07 | Paper |
Expressive Power of Broadcast Consensus Protocols
(available as arXiv preprint) | 2023-02-03 | Paper |
Advances in quantitative analysis of free-choice workflow Petri nets (invited talk)
1515.68203 | 2023-02-03 | Paper |
Complexity of Verification and Synthesis of Threshold Automata
1517.68221 | 2022-12-22 | Paper |
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Model checking LTL using constraint programming | 2022-12-09 | Paper |
A Unified Translation of Linear Temporal Logic to ω-Automata
Journal of the ACM | 2022-12-08 | Paper |
Model checking using net unfoldings
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Computing Parameterized Invariants of Parameterized Petri Nets
Fundamenta Informaticae | 2022-10-31 | Paper |
Structural Invariants for the Verification of Systems with Parameterized Architectures
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7559466 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Flatness and Complexity of Immediate Observation Petri Nets
(available as arXiv preprint) | 2022-07-18 | Paper |
| Examples for submission to CONCUR'22 | 2022-04-22 | Dataset |
| Back to the future: a fresh look at linear temporal logic | 2022-03-22 | Paper |
Computing parameterized invariants of parameterized Petri nets
(available as arXiv preprint) | 2022-03-21 | Paper |
Towards efficient verification of population protocols
Formal Methods in System Design | 2021-12-08 | Paper |
| Verification | 2021-11-12 | Paper |
Finding cut-offs in leaderless rendez-vous protocols is easy
(available as arXiv preprint) | 2021-10-18 | Paper |
Verification of Immediate Observation Population Protocols
(available as arXiv preprint) | 2021-08-04 | Paper |
Automatic analysis of expected termination time for population protocols
(available as arXiv preprint) | 2021-08-04 | Paper |
The complexity of verifying population protocols
Distributed Computing | 2021-05-17 | Paper |
Checking qualitative liveness properties of replicated systems with stochastic scheduling
(available as arXiv preprint) | 2021-02-09 | Paper |
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Black Ninjas in the dark: formal analysis of population protocols
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
One theorem to rule them all: a unified translation of LTL into -automata
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Static analysis of deterministic negotiations
(available as arXiv preprint) | 2021-01-19 | Paper |
| Static analysis of deterministic negotiations | 2021-01-19 | Paper |
From LTL and limit-deterministic Büchi automata to deterministic parity automata
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Large flocks of small birds: on the minimal size of population protocols
(available as arXiv preprint) | 2020-08-05 | Paper |
Computing the concurrency threshold of sound free-choice workflow nets
(available as arXiv preprint) | 2019-09-16 | Paper |
Limit-deterministic Büchi automata for linear temporal logic
Computer Aided Verification | 2019-05-03 | Paper |
Negotiation as concurrency primitive
Acta Informatica | 2019-03-14 | Paper |
Parameterized Verification of Asynchronous Shared-Memory Systems
Journal of the ACM | 2018-08-02 | Paper |
Model checking procedural programs
Handbook of Model Checking | 2018-07-20 | Paper |
| Model checking population protocols | 2018-04-19 | Paper |
| Soundness in negotiations | 2018-03-21 | Paper |
Model checking parameterized asynchronous shared-memory systems
Lecture Notes in Computer Science | 2018-03-01 | Paper |
Soundness in negotiations
(available as arXiv preprint) | 2018-01-23 | Paper |
Polynomial analysis algorithms for free choice probabilistic workflow nets
(available as arXiv preprint) | 2018-01-11 | Paper |
Towards efficient verification of population protocols
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Verification of Population Protocols | 2017-09-12 | Paper |
| Advances in parameterized verification of population protocols | 2017-08-22 | Paper |
From LTL to deterministic automata. A safraless compositional approach
Formal Methods in System Design | 2017-07-26 | Paper |
Negotiations and Petri nets
Transactions on Petri Nets and Other Models of Concurrency XI | 2017-06-20 | Paper |
A perfect model for bounded verification
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Model checking parameterized asynchronous shared-memory systems
Formal Methods in System Design | 2017-05-15 | Paper |
Verification of population protocols
Acta Informatica | 2017-04-20 | Paper |
Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
(available as arXiv preprint) | 2017-03-03 | Paper |
Computation of summaries using net unfoldings
(available as arXiv preprint) | 2017-02-21 | Paper |
Existence of home states in Petri nets is decidable
Information Processing Letters | 2016-04-06 | Paper |
\textsc{FPsolve}: a generic solver for fixpoint equations over semirings
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
A generic approach to the static analysis of concurrent programs with procedures
Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Negotiation programs
Application and Theory of Petri Nets and Concurrency | 2015-08-27 | Paper |
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Distributed Markov chains
Lecture Notes in Computer Science | 2015-02-04 | Paper |
Message-passing algorithms for the verification of distributed protocols
Lecture Notes in Computer Science | 2015-01-13 | Paper |
An SMT-based approach to coverability analysis
Computer Aided Verification | 2014-09-29 | Paper |
FPsolve: a generic solver for fixpoint equations over semirings
Implementation and Application of Automata | 2014-09-26 | Paper |
Deterministic Negotiations: Concurrency for Free
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
Information Processing Letters | 2014-08-13 | Paper |
Analyzing probabilistic pushdown automata
Formal Methods in System Design | 2014-06-30 | Paper |
On negotiation as concurrency primitive. II: Deterministic cyclic negotiations
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Complexity of pattern-based verification for multithreaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
A Brief History of Strahler Numbers
Language and Automata Theory and Applications | 2014-03-31 | Paper |
| Reachability analysis of synchronized PA systems | 2013-10-02 | Paper |
On negotiation as concurrency primitive
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Parikh's theorem: a simple and direct automaton construction
Information Processing Letters | 2013-03-28 | Paper |
Convergence thresholds of Newton's method for monotone polynomial equations
(available as arXiv preprint) | 2013-03-19 | Paper |
| Convergence thresholds of Newton's method for monotone polynomial equations | 2013-03-19 | Paper |
Three case studies on verification of infinite-state systems
Modern Applications of Automata Theory | 2013-02-26 | Paper |
Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
| On the memory consumption of probabilistic pushdown automata | 2012-10-24 | Paper |
Space-efficient scheduling of stochastically generated tasks
Information and Computation | 2012-05-24 | Paper |
| Learning workflow Petri nets | 2012-03-22 | Paper |
