We consider the model of history-deterministic one-counter nets (OCNs). History-
determinism is a property of transition systems that allows for a limited kind of non …

We consider history-determinism, a restricted form of non-determinism, for Vector Addition
Systems with States (VASS) when used as acceptors to recognise languages of finite words …

We consider the model-checking problem for freeze LTL on one-counter automata (OCA).
Freeze LTL extends LTL with the freeze quantifier, which allows one to store different …

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 …

We study the language universality problem for One-Counter Nets, also known as 1-
dimensional Vector Addition Systems with States (1-VASS), parameterized either with an …

One-Counter Nets (OCNs) are finite-state automata equipped with a counter that is not
allowed to become negative, but does not have zero tests. Their simplicity and close …

We study the problem of computing the reachable principals of the simulation preorder and
the reachable blocks of simulation equivalence. Following a theoretical investigation of this …

For a given process equivalence, we say that a process g is fully equivalent to a process f of
a transition system T if g is equivalent to f and every reachable state of g is equivalent to …

We study the problem of computing the reachable principals of the simulation preorder and
the reachable blocks of simulation equivalence. Following a theoretical investigation of this …

We answer an open complexity question for simulation preorder of succinct one-counter
nets (ie, one-counter automata with no zero tests where counter increments and decrements …