Presentation	1998/1/23 On the Use of Unfolding to Describe the State Space of the Earliest Firing Petri Net. Atsushi OHTA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Petri Net is a modeling tool for discrete event systems. It has more modeling power than finite automaton and more analysis power than Turing machine. Most analysis problems of Petri net are decidable, however, need enormous computational complexity. It has been pointed out that exploding size of state space of Petri net is one of the reason of the complexity. Unfolding has been used to describe the state space of Petri net in relatively small size. On the otherhand, introduction of the earliest firing rule, where transitions must fire as soon as it is enabled, makes Petri net equivalent to Turing machine. This report suggests a procedure to describe the state space of the earliest firing Petri net using unfolding.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	discrete event system / earliest firing Petri net / unfolding
Paper #	CST97-35
Date of Issue

Conference Information
Committee	CST
Conference Date	1998/1/23(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	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the Use of Unfolding to Describe the State Space of the Earliest Firing Petri Net.
Sub Title (in English)
Keyword(1)	discrete event system
Keyword(2)	earliest firing Petri net
Keyword(3)	unfolding
1st Author's Name	Atsushi OHTA
1st Author's Affiliation	Faculty of Literature, Aichi Prefectural University()
Date	1998/1/23
Paper #	CST97-35
Volume (vol)	vol.97
Number (no)	507
Page	pp.pp.-
#Pages	4
Date of Issue