Add to ORKGWe show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems
International audienceContinuous Petri nets are a relaxation of classical discrete Petri nets in whi...
We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets ext...
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability ...
We show that the coverability problem in ν-Petri nets is complete for ‘double Ackermann’ time, thus ...
We study an extension of classical Petri nets where tokens carry values from a countable data domain...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceIn the early two-thousands, Recursive Petri nets have been introduced in order...
International audienceWe investigate three particular instances of the marking coverability problem ...
Formal methods provide means for rigorously specifying the desired behaviour of a hardware or softwa...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceThe coverability problem for Petri nets plays a central role in the verificati...
Timed-Arc Petri Nets (TAPN) is a well studied extensionof the classical Petri net model where tokens...
Petri nets, equivalently presentable as vector addition systems with states, are an established mode...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceThe verification of infinite-state systems is a challenging task. A prominent ...
International audienceContinuous Petri nets are a relaxation of classical discrete Petri nets in whi...
We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets ext...
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability ...
We show that the coverability problem in ν-Petri nets is complete for ‘double Ackermann’ time, thus ...
We study an extension of classical Petri nets where tokens carry values from a countable data domain...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceIn the early two-thousands, Recursive Petri nets have been introduced in order...
International audienceWe investigate three particular instances of the marking coverability problem ...
Formal methods provide means for rigorously specifying the desired behaviour of a hardware or softwa...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceThe coverability problem for Petri nets plays a central role in the verificati...
Timed-Arc Petri Nets (TAPN) is a well studied extensionof the classical Petri net model where tokens...
Petri nets, equivalently presentable as vector addition systems with states, are an established mode...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceThe verification of infinite-state systems is a challenging task. A prominent ...
International audienceContinuous Petri nets are a relaxation of classical discrete Petri nets in whi...
We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets ext...
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability ...