Presentation 2003/5/30
Unfolding of Petri nets with semi-linear reachability set
Atsushi OHTA, Kohkichi TSUJI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Petri net is an efficient model for concurrent systems. State space of a general Petri net is infinite. Even if it is finite, its size grows expornentially as the size of the net does. This problem, called state space explosion, makes Petri net analysis hard. Unfolding is suggested to give a compact description of the state space of a bounded Petri net. This is extended to unbounded net using ω borrowed from the coverability tree generating algorithm. However, using ω causes lack of information. On the other hand, if unbounded Petri net has a semilinear state space, it can be expressed without lack of information with extended coverability tree. This report suggests an extension of unfolding of Petri net with semilinear state space without lack of information.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) concurrent system / Petri net / unfolding / semilinear set
Paper # CST2003-1
Date of Issue

Conference Information
Committee CST
Conference Date 2003/5/30(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) Unfolding of Petri nets with semi-linear reachability set
Sub Title (in English)
Keyword(1) concurrent system
Keyword(2) Petri net
Keyword(3) unfolding
Keyword(4) semilinear set
1st Author's Name Atsushi OHTA
1st Author's Affiliation Faculty of Information Science and Technology, Aichi Prefectural University()
2nd Author's Name Kohkichi TSUJI
2nd Author's Affiliation Faculty of Information Science and Technology, Aichi Prefectural University
Date 2003/5/30
Paper # CST2003-1
Volume (vol) vol.103
Number (no) 105
Page pp.pp.-
#Pages 6
Date of Issue