Presentation 1996/10/18
On the Liveness of a Subclass of Time Petri Nets with Some Restriction on Firing Delays of Transitions.
Atsushi OHTA, Tomiji HISAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Time Petri net is an effective tool to evaluate discrete event systems. This report treats the liveness problem of Merlin's time Petri nets, where each transition has minimal and maximal firing delays after it is enabled. This time Petri net is proved to be equivalent to Turing machines. That means analysis problems of this extended net are undecidable. This report shows that time asymmetric choice net is live under some restriction of firing delays of transitions, if the corresponding non-timed net is live. Lastly, a subclass of time Petri net is shown where liveness is decidable.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) discrete event system / time Petri net / liveness
Paper # CSA96-58,CST96-16
Date of Issue

Conference Information
Committee CAS
Conference Date 1996/10/18(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Liveness of a Subclass of Time Petri Nets with Some Restriction on Firing Delays of Transitions.
Sub Title (in English)
Keyword(1) discrete event system
Keyword(2) time Petri net
Keyword(3) liveness
1st Author's Name Atsushi OHTA
1st Author's Affiliation School of Science and Engineering, Waseda University()
2nd Author's Name Tomiji HISAMURA
2nd Author's Affiliation School of Science and Engineering, Waseda University
Date 1996/10/18
Paper # CSA96-58,CST96-16
Volume (vol) vol.96
Number (no) 309
Page pp.pp.-
#Pages 6
Date of Issue