Add to ORKGWe look in detail at the structural liveness problem (SLP) for subclasses of Petri nets, namely immediate observation nets (IO nets) and their generalized variant called branching immediate multi-observation nets (BIMO nets), that were recently introduced by Esparza, Raskin, and Weil-Kennedy. We show that SLP is PSPACE-hard for IO nets and in PSPACE for BIMO nets. In particular, we discuss the (small) bounds on the token numbers in net places that are decisive for a marking to be (non)live.Comment: Significantly extended w.r.t. the previous versio
We consider Petri nets (PNs) [3, 5] where each transition can be prevented from firing by an externa...
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lip...
AbstractA necessary and sufficient condition for a Petri net to be weakly persistent for every initi...
We look in detail at the structural liveness problem (SLP) for subclasses ofPetri nets, namely immed...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
In a previous paper we introduced immediate observation (IO) Petri nets, a class of interest in the ...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In ...
Abstract. In Petri net systems, liveness is an important property cap-turing the idea of no transiti...
Petri nets are one of useful models for discrete event systems in which liveness problem as well as ...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Submitted as a theory paper Abstract. This paper presents new results concerned with liveness, live-...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \cite{ABS91} and p...
43 pagesPetri nets proved useful to describe various real-world systems, but many of their propertie...
We consider Petri nets (PNs) [3, 5] where each transition can be prevented from firing by an externa...
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lip...
AbstractA necessary and sufficient condition for a Petri net to be weakly persistent for every initi...
We look in detail at the structural liveness problem (SLP) for subclasses ofPetri nets, namely immed...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
In a previous paper we introduced immediate observation (IO) Petri nets, a class of interest in the ...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In ...
Abstract. In Petri net systems, liveness is an important property cap-turing the idea of no transiti...
Petri nets are one of useful models for discrete event systems in which liveness problem as well as ...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Submitted as a theory paper Abstract. This paper presents new results concerned with liveness, live-...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \cite{ABS91} and p...
43 pagesPetri nets proved useful to describe various real-world systems, but many of their propertie...
We consider Petri nets (PNs) [3, 5] where each transition can be prevented from firing by an externa...
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lip...
AbstractA necessary and sufficient condition for a Petri net to be weakly persistent for every initi...