Submarking Reachability of Marked Graphs with Token Capacity Constraints
Summary :
Reachability of marked graphs with token capacity constraints is generalized to that with respect to any subgraph of the marked graph. It is shown that submarking reachability is equivalent to the existence of a minimum firing count vector satisfying a set of equality and inequality constraints. A necessary and sufficient condition is presented for the existence of the minimum firing count vector together with its constructing algorithm. The result can be applied in finding the firing sequence of minimum length in practical sequential control problems.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E67-E No.7 pp.373-378
- Publication Date
- 1984/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- General
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Sadatoshi KUMAGAI, Shinzo KODAMA, Mitsuhiro KITAGAWA, "Submarking Reachability of Marked Graphs with Token Capacity Constraints" in IEICE TRANSACTIONS on transactions,
vol. E67-E, no. 7, pp. 373-378, July 1984, doi: .
Abstract: Reachability of marked graphs with token capacity constraints is generalized to that with respect to any subgraph of the marked graph. It is shown that submarking reachability is equivalent to the existence of a minimum firing count vector satisfying a set of equality and inequality constraints. A necessary and sufficient condition is presented for the existence of the minimum firing count vector together with its constructing algorithm. The result can be applied in finding the firing sequence of minimum length in practical sequential control problems.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e67-e_7_373/_p
Copy
@ARTICLE{e67-e_7_373,
author={Sadatoshi KUMAGAI, Shinzo KODAMA, Mitsuhiro KITAGAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={Submarking Reachability of Marked Graphs with Token Capacity Constraints},
year={1984},
volume={E67-E},
number={7},
pages={373-378},
abstract={Reachability of marked graphs with token capacity constraints is generalized to that with respect to any subgraph of the marked graph. It is shown that submarking reachability is equivalent to the existence of a minimum firing count vector satisfying a set of equality and inequality constraints. A necessary and sufficient condition is presented for the existence of the minimum firing count vector together with its constructing algorithm. The result can be applied in finding the firing sequence of minimum length in practical sequential control problems.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Submarking Reachability of Marked Graphs with Token Capacity Constraints
T2 - IEICE TRANSACTIONS on transactions
SP - 373
EP - 378
AU - Sadatoshi KUMAGAI
AU - Shinzo KODAMA
AU - Mitsuhiro KITAGAWA
PY - 1984
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E67-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1984
AB - Reachability of marked graphs with token capacity constraints is generalized to that with respect to any subgraph of the marked graph. It is shown that submarking reachability is equivalent to the existence of a minimum firing count vector satisfying a set of equality and inequality constraints. A necessary and sufficient condition is presented for the existence of the minimum firing count vector together with its constructing algorithm. The result can be applied in finding the firing sequence of minimum length in practical sequential control problems.
ER -
English
