14 citations · 35 across the 12 of their papers we have counts for
7 papers · 1 filter
Monus semantics in vector addition systems with states
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki +1
Vector addition systems with states (VASS) are a popular model for concurrent systems. However, many decision problems have prohibitively high complexity. Therefore, it is sometime…
Verifying generalised and structural soundness of workflow nets via relaxations
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Workflow nets are a well-established mathematical formalism for the analysis of business processes arising from either modeling tools or process mining. The central decision proble…
The complexity of soundness in workflow nets
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Workflow nets are a popular variant of Petri nets that allow for algorithmic formal analysis of business processes. The central decision problems concerning workflow nets deal with…
Pumping lemmas for weighted automata
Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl +1
We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural nu…
Affine Extensions of Integer Vector Addition Systems with States
Michael Blondin, Christoph Haase, Filip Mazowiecki +1
We study the reachability problem for affine -VASS, which are integer vector addition systems with states in which transitions perform affine transformations on the cou…
Eliminating Recursion from Monadic Datalog Programs on Trees
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether…
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
Witold Charatonik, Emanuel Kieroński, Filip Mazowiecki
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates an…