AbstractThis paper concerns two important techniques, characterization and property-preserving transformation, for verifying some basic properties of asymmetric choice Petri nets (AC nets). In the literature, a majority of the characterizations are for ordinary free choice nets. This paper presents many extended (from free choice nets) and new characterizations for four properties: liveness with respect to an initial marking, liveness monotonicity with respect to an initial marking, well-formedness, liveness and boundedness with respect to an initial marking. The nets involved are extended to homogeneous free choice nets, ordinary AC nets and homogeneous AC nets. This paper also investigates the transformation of merging a set of places of ...
AbstractA refinement is a transformation for replacing a simple entity of a system with its function...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
AbstractThe reachability problem for Petri nets can be stated as follows: Given a Petri net (N, M0) ...
AbstractThis paper concerns two important techniques, characterization and property-preserving trans...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
International audienceWeighted Petri nets provide convenient models of many man-made systems. Real a...
Submitted as a theory paper Abstract. This paper presents new results concerned with liveness, live-...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
International audienceA Petri net is reversible if its initial marking is a home marking, a marking ...
International audienceA Petri net is reversible if its initial marking is a home marking, a marking ...
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net t...
The thesis contributes to the theoretical study of Petri net theory. We conduct boundedness and live...
Well-behaved SNC covers well-behaved and various classes of FC (free-choice) and is not included in ...
43 pagesPetri nets proved useful to describe various real-world systems, but many of their propertie...
AbstractFree choice nets are a subclass of Petri nets allowing to model concurrency and nondetermini...
AbstractA refinement is a transformation for replacing a simple entity of a system with its function...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
AbstractThe reachability problem for Petri nets can be stated as follows: Given a Petri net (N, M0) ...
AbstractThis paper concerns two important techniques, characterization and property-preserving trans...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
International audienceWeighted Petri nets provide convenient models of many man-made systems. Real a...
Submitted as a theory paper Abstract. This paper presents new results concerned with liveness, live-...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
International audienceA Petri net is reversible if its initial marking is a home marking, a marking ...
International audienceA Petri net is reversible if its initial marking is a home marking, a marking ...
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net t...
The thesis contributes to the theoretical study of Petri net theory. We conduct boundedness and live...
Well-behaved SNC covers well-behaved and various classes of FC (free-choice) and is not included in ...
43 pagesPetri nets proved useful to describe various real-world systems, but many of their propertie...
AbstractFree choice nets are a subclass of Petri nets allowing to model concurrency and nondetermini...
AbstractA refinement is a transformation for replacing a simple entity of a system with its function...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
AbstractThe reachability problem for Petri nets can be stated as follows: Given a Petri net (N, M0) ...