research
∙
10/18/2022
Compiling Petri Net Mutual Reachability in Presburger
Petri nets are a classical model of concurrency widely used and studied ...
share
research
∙
07/06/2022
Semilinear Home-space is Decidable for Petri Nets
A set of configurations 𝐇 is an home-space for a set of configurations 𝐗...
research
∙
09/30/2021
State Complexity of Counting Population Protocols With Leaders
Population protocols are a model of computation in which an arbitrary nu...
research
∙
09/17/2021
New Algorithms for Combinations of Objectives using Separating Automata
The notion of separating automata was introduced by Bojanczyk and Czerwi...
research
∙
04/26/2021
The Reachability Problem for Petri Nets is Not Primitive Recursive
We present a way to lift up the Tower complexity lower bound of the reac...
research
∙
07/17/2020
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
Vector addition system with states is an ubiquitous model of computation...
research
∙
09/12/2019
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification
This volume contains the proceedings of the Tenth International Symposiu...
research
∙
03/20/2019
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
The reachability problem in vector addition systems is a central questio...
research
∙
09/19/2018
The Reachability Problem for Petri Nets is Not Elementary
Petri nets, also known as vector addition systems, are a long establishe...
research
∙
09/19/2018