3 papers
cs.FL2025
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
Ismaël Jecker, Filip Mazowiecki, David Purser
We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equival…
cs.FL2025
Soundness of reset workflow nets
Michael Blondin, Alain Finkel, Piotr Hofman +2
Workflow nets are a well-established variant of Petri nets for the modeling of process activities such as business processes. The standard correctness notion of workflow nets is so…
cs.FL2024
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Dmitry Chistikov, Wojciech CzerwiÅski, Filip Mazowiecki +3
Vector Addition Systems with States (VASS), equivalent to Petri nets, are a well-established model of concurrency. The central algorithmic challenge in VASS is the reachability pro…