Presentation 2012-03-08
Consideration on the token retention-free in timed Petri net model based on the signaling pathway characteristics
Yuki MURAKAMI, Qi-Wei GE, Hiroshi MATSUNO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Retention-free Petri net is a timed Petri net such that total input and total output token flows are equivalent at any place. Petri net models converted from signaling pathways generally contain synchronous transition, conflict transition, self-loop arc, and inhibitory arcs. In order for the converted-Petri net model to be retention-free, these kinds of transitions and arcs should be treated appropriately. This paper considers the conditions that should be satisfied for a Petri net model having these transitions and arcs to be retention-free.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) signaling pathways / timed Petri net / retention-free Petri net
Paper # MSS2011-77
Date of Issue

Conference Information
Committee MSS
Conference Date 2012/3/1(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 Mathematical Systems Science and its applications(MSS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Consideration on the token retention-free in timed Petri net model based on the signaling pathway characteristics
Sub Title (in English)
Keyword(1) signaling pathways
Keyword(2) timed Petri net
Keyword(3) retention-free Petri net
1st Author's Name Yuki MURAKAMI
1st Author's Affiliation Graduate School of Science and Engineering, Yamaguchi University()
2nd Author's Name Qi-Wei GE
2nd Author's Affiliation Faculty of Education, Yamaguchi University
3rd Author's Name Hiroshi MATSUNO
3rd Author's Affiliation Graduate School of Science and Engineering, Yamaguchi University
Date 2012-03-08
Paper # MSS2011-77
Volume (vol) vol.111
Number (no) 453
Page pp.pp.-
#Pages 6
Date of Issue