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
Abstract—We motivate and study the subnet reduction of Petri nets. Subnet reduction can avoid the st...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. State explosion is a fundamental problem in the analysis and synthesis of discrete event s...
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...
A polynomial algorithm was given by the authors and Bernardinello for synthesizing pure weighted Pet...
International audienceThis book is a comprehensive, systematic survey of the synthesis problem, and ...
We consider Petri nets (PNs) [3, 5] where each transition can be prevented from firing by an externa...
International audienceThis book is a comprehensive, systematic survey of the synthesis problem, and ...
International audienceIn Petri nets, computation is performed by executing transitions. An effect-re...
Labelled transition systems are a simple yet powerful formalism for describing the operational behav...
International audienceIn Petri nets, computation is performed by executing transitions. An effect-re...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
We suggest a new notion of behaviour preserving transition refinement based on partial order semanti...
Abstract—We motivate and study the subnet reduction of Petri nets. Subnet reduction can avoid the st...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. State explosion is a fundamental problem in the analysis and synthesis of discrete event s...
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...
A polynomial algorithm was given by the authors and Bernardinello for synthesizing pure weighted Pet...
International audienceThis book is a comprehensive, systematic survey of the synthesis problem, and ...
We consider Petri nets (PNs) [3, 5] where each transition can be prevented from firing by an externa...
International audienceThis book is a comprehensive, systematic survey of the synthesis problem, and ...
International audienceIn Petri nets, computation is performed by executing transitions. An effect-re...
Labelled transition systems are a simple yet powerful formalism for describing the operational behav...
International audienceIn Petri nets, computation is performed by executing transitions. An effect-re...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
We suggest a new notion of behaviour preserving transition refinement based on partial order semanti...
Abstract—We motivate and study the subnet reduction of Petri nets. Subnet reduction can avoid the st...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. State explosion is a fundamental problem in the analysis and synthesis of discrete event s...
DOI
Add to ORKG