IEICE TRANSACTIONS on Fundamentals
The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
Summary :
The subject of the paper is the minimum initial marking problem for scheduling in timed Petri net PN: given a vector X of nonnegative integers, a P-invariant Y of PN and a nonnegative integer π, find an initial marking M minimizing the value Ytr・M among those initial marking M
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.10 pp.1407-1421
- Publication Date
- 1992/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
- Category
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
Toshimasa WATANABE, Takenobu TANIDA, Masahiro YAMAUCHI, Kenji ONAGA, "The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 10, pp. 1407-1421, October 1992, doi: .
Abstract: The subject of the paper is the minimum initial marking problem for scheduling in timed Petri net PN: given a vector X of nonnegative integers, a P-invariant Y of PN and a nonnegative integer π, find an initial marking M minimizing the value Ytr・M among those initial marking M
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_10_1407/_p
Copy
@ARTICLE{e75-a_10_1407,
author={Toshimasa WATANABE, Takenobu TANIDA, Masahiro YAMAUCHI, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets},
year={1992},
volume={E75-A},
number={10},
pages={1407-1421},
abstract={The subject of the paper is the minimum initial marking problem for scheduling in timed Petri net PN: given a vector X of nonnegative integers, a P-invariant Y of PN and a nonnegative integer π, find an initial marking M minimizing the value Ytr・M among those initial marking M
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1407
EP - 1421
AU - Toshimasa WATANABE
AU - Takenobu TANIDA
AU - Masahiro YAMAUCHI
AU - Kenji ONAGA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1992
AB - The subject of the paper is the minimum initial marking problem for scheduling in timed Petri net PN: given a vector X of nonnegative integers, a P-invariant Y of PN and a nonnegative integer π, find an initial marking M minimizing the value Ytr・M among those initial marking M
ER -
English
