Add to ORKGWe solve the following problem: given an automaton that represents the coverability graph of a net, determine a net system whose coverability graph is isomorph to the automa-ton. Our approach requires solving an integer programming problem whose set of unknowns contains the elements of the pre and post incidence matrices and the initial marking of the net
Abstract — In this paper we deal with the problem of identifying a Petri net system, given a finite ...
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be...
Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings...
In this paper we deal with the problem of identifying a Petri net system, given a finite language ge...
In this paper we deal with the problem of identifying a Petri net system, given a finite language ge...
Petri nets have been proposed as a fundamental model for discrete-event systems in a wide variety of...
Master's thesis in Computer sciencePetri nets are a long time established modeling concept for model...
International audiencePetri nets have been proposed as a fundamental model for discrete-event system...
In this paper we consider the property of diagnosability for labeled unbounded Petri nets, namely Pe...
In [1], an algorithm to compute a minimal coverability tree for Petri nets has been presented. This...
International audienceWe study Parametric Petri Nets (PPNs), i.e., Petri nets for which some arc wei...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audienceThe verification of infinite-state systems is a challenging task. A prominent ...
Abstract — In a previous paper we presented an approach to identify a Petri net system, given a fini...
Abstract — In this paper we deal with the problem of identifying a Petri net system, given a finite ...
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be...
Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings...
In this paper we deal with the problem of identifying a Petri net system, given a finite language ge...
In this paper we deal with the problem of identifying a Petri net system, given a finite language ge...
Petri nets have been proposed as a fundamental model for discrete-event systems in a wide variety of...
Master's thesis in Computer sciencePetri nets are a long time established modeling concept for model...
International audiencePetri nets have been proposed as a fundamental model for discrete-event system...
In this paper we consider the property of diagnosability for labeled unbounded Petri nets, namely Pe...
In [1], an algorithm to compute a minimal coverability tree for Petri nets has been presented. This...
International audienceWe study Parametric Petri Nets (PPNs), i.e., Petri nets for which some arc wei...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audienceThe verification of infinite-state systems is a challenging task. A prominent ...
Abstract — In a previous paper we presented an approach to identify a Petri net system, given a fini...
Abstract — In this paper we deal with the problem of identifying a Petri net system, given a finite ...
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be...