Presentation 1994/11/17
A method for finding the firing sequences of Petri nets with linear programming techniques
Yasumasa FUJII, Takashi SEKIGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Finding firing sequences for the reachability problem of Petri nets can be regarded as one of the most important issues in the analysis of discrete event systems. The purpose of this study is to develop a new method for finding firing sequences. First, defining an extended matrix equation with a firing counter vector, the proposed method is formulated as an linear programming problem whose solution can provide sufficient information on the firing sequences within a computational time of polynomial order. Secondly, the sufficient condition for polynomial time complexity in computing a firing counter vector is discussed on the basis of the unimodularity of incidence matrices of Petri nets.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Petri Net / Firing Sequence / Linear Programming / Unimodularity
Paper # CAS94-67,CST94-27
Date of Issue

Conference Information
Committee CST
Conference Date 1994/11/17(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) A method for finding the firing sequences of Petri nets with linear programming techniques
Sub Title (in English)
Keyword(1) Petri Net
Keyword(2) Firing Sequence
Keyword(3) Linear Programming
Keyword(4) Unimodularity
1st Author's Name Yasumasa FUJII
1st Author's Affiliation Division of Electrical and Computer Engineering, Yokohama National University()
2nd Author's Name Takashi SEKIGUCHI
2nd Author's Affiliation Division of Electrical and Computer Engineering, Yokohama National University
Date 1994/11/17
Paper # CAS94-67,CST94-27
Volume (vol) vol.94
Number (no) 333
Page pp.pp.-
#Pages 8
Date of Issue