research
∙
05/26/2022
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
We consider linear cost-register automata (equivalent to weighted automa...
share
research
∙
03/08/2022
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
We study the complexity of the reachability problem for Vector Addition ...
research
∙
02/16/2022
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
We consider the problems of language inclusion and language equivalence ...
research
∙
04/28/2021
Reachability in Vector Addition Systems is Ackermann-complete
Vector Addition Systems and equivalent Petri nets are a well established...
research
∙
07/21/2020
Universality Problem for Unambiguous VASS
We study languages of unambiguous VASS, that is, Vector Addition Systems...
research
∙
06/30/2020
An Approach to Regular Separability in Vector Addition Systems
We study the problem of regular separability of languages of vector addi...
research
∙
05/31/2020
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
We present a data structure that in a dynamic graph of treedepth at most...
research
∙
04/30/2019
Improved bounds for the excluded-minor approximation of treedepth
Treedepth, a more restrictive graph width parameter than treewidth and p...
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
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)
Petri nets, also known as vector addition systems, are a long establishe...
research
∙
07/27/2018
