AbstractIf the firing of a transition in a Petri net is considered non instantaneous, it becomes possible to replace a transition in a net P by another net P′ This allows to proceed the description and the analysis of a control structure by stepwise refinements. The necessary and sufficient conditions on P and P′ for the resulting net to be bounded and live, are given
Concurrent programming is used in all large and complex computer systems. However, concurrency error...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
AbstractIf the firing of a transition in a Petri net is considered non instantaneous, it becomes pos...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
This paper presents a method to synthesize labeled Petri nets from state-based models. Although stat...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Bibliography: pages 124-127.This study investigates the complexity of various reduction and synthesi...
Discrete-Event Systems are discrete in nature, driven by discrete events. Petri Nets are one of the ...
Discrete-Event Systems are discrete in nature, driven by discrete events. Petri Nets are one of the ...
We introduce the notion of T-path within Petri nets, and propose a simple approach, based on previou...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Concurrent programming is used in all large and complex computer systems. However, concurrency error...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
AbstractIf the firing of a transition in a Petri net is considered non instantaneous, it becomes pos...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
This paper presents a method to synthesize labeled Petri nets from state-based models. Although stat...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Bibliography: pages 124-127.This study investigates the complexity of various reduction and synthesi...
Discrete-Event Systems are discrete in nature, driven by discrete events. Petri Nets are one of the ...
Discrete-Event Systems are discrete in nature, driven by discrete events. Petri Nets are one of the ...
We introduce the notion of T-path within Petri nets, and propose a simple approach, based on previou...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Concurrent programming is used in all large and complex computer systems. However, concurrency error...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
In Petri nets, computation is performed by executing transitions. An effect-reverse of a given trans...
DOI
Add to ORKG