Presentation 2003/7/29
Finding Legal Firing Sequences of Timed Petri Nets Based on Postponing Firing Activity of Transitions
Tsuyoshi TACHIBATAKE, Satoshi TAOKA, Toshimasa WATANABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Timed Petri Net Maximum Scheduling Probrem (MAX TPS for short) is defined as follows: "Given a timed Petri net TPN, an initial marking M and a firing count vector X, find a firing sequence δ satisfying the following (i) through (iii): (i) δ is legal on M with respect to some X'≦X; (ii) the length |δ| of δis maximum among those sequences satisfying (i), (iii) the completion time τ(δ) of δ is minimum among those satisfying (ii), where X'≦X means that X'(t) ≦ X(t) for any t ∈ T." This paper proposes a heuristic algorithm SDS2-pdc and shows, through computational experiment, that its capability is the highest among existing ones.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) timed Petri nets / scheduling / legal firing sequence problems
Paper # CST2003-12
Date of Issue

Conference Information
Committee CST
Conference Date 2003/7/29(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Concurrent System Technology (CST)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finding Legal Firing Sequences of Timed Petri Nets Based on Postponing Firing Activity of Transitions
Sub Title (in English)
Keyword(1) timed Petri nets
Keyword(2) scheduling
Keyword(3) legal firing sequence problems
1st Author's Name Tsuyoshi TACHIBATAKE
1st Author's Affiliation Graduate School of Engineering, Hiroshima University()
2nd Author's Name Satoshi TAOKA
2nd Author's Affiliation Graduate School of Engineering, Hiroshima University
3rd Author's Name Toshimasa WATANABE
3rd Author's Affiliation Graduate School of Engineering, Hiroshima University
Date 2003/7/29
Paper # CST2003-12
Volume (vol) vol.103
Number (no) 247
Page pp.pp.-
#Pages 6
Date of Issue