Presentation	2004-11-04 On the Effect of Firing Inhibition in Finding Firing Sequences of Timed Petri Nets Tsuyoshi TACHIBATAKE, Satoshi TAOKA, Toshimasa WATANABE,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The paper proposes several heuristic algorithms for the Timed Petri Net Maximum Scheduling Probrem (MAX TPS for short). These algorithms are improved from the existing one SDS2_ for MAX TPS by incorporating a procedure BACKTRACK_R for randomly backtracking. It has been known that the firing inhibition rules are very useful for solving MAX LFS. The paper evaluates, through computational experiment, how these rules help us find firing sequences of timed petri nets.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	timed Ptri nets / schedulings / legal firing sequence problems
Paper #	CAS2004-55,CST2004-34
Date of Issue

Conference Information
Committee	CAS
Conference Date	2004/10/28(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	Circuits and Systems (CAS)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the Effect of Firing Inhibition in Finding Firing Sequences of Timed Petri Nets
Sub Title (in English)
Keyword(1)	timed Ptri nets
Keyword(2)	schedulings
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	2004-11-04
Paper #	CAS2004-55,CST2004-34
Volume (vol)	vol.104
Number (no)	402
Page	pp.pp.-
#Pages	6
Date of Issue