Showing cs.FLShow all
2 papers · 1 filter
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.FL2021
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki +2
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter…