The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Étant donné un réseau de Petri PN=(P, T, E), un siphon est un ensemble S d'endroits tels que l'ensemble des transitions d'entrée vers S est inclus dans l'ensemble des transitions de sortie de S. Concernant l'extraction de siphons minimaux contenant un ensemble spécifié donné Q de lieux, l'article propose trois algorithmes basés sur la méthode de branchement et de liaison pour énumérer, le cas échéant, tous les siphons minimaux contenant Q, ainsi que pour extraire un tel siphon minimal.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masahiro YAMAUCHI, Toshimasa WATANABE, "Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 11, pp. 2566-2575, November 1999, doi: .
Abstract: Given a Petri net PN=(P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_11_2566/_p
Copier
@ARTICLE{e82-a_11_2566,
author={Masahiro YAMAUCHI, Toshimasa WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net},
year={1999},
volume={E82-A},
number={11},
pages={2566-2575},
abstract={Given a Petri net PN=(P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.},
keywords={},
doi={},
ISSN={},
month={November},}
Copier
TY - JOUR
TI - Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2566
EP - 2575
AU - Masahiro YAMAUCHI
AU - Toshimasa WATANABE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1999
AB - Given a Petri net PN=(P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.
ER -