Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net

Masahiro YAMAUCHI; Toshimasa WATANABE

Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net

Masahiro YAMAUCHI, Toshimasa WATANABE

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.11 pp.2566-2575

Publication Date: 1999/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems Technology)

Category

Cite this

Copy

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

Copy

@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},}

Copy

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 -