Presentation	1997/11/28 A Simple Method of Detection for Invariants Yoshihiro UEDA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this paper, efficient search algorithm is reported of Invariant which is utilized concerning a structural analysis of Petri Nets. It is important for a requiremant specification that describes a state transition of service of a communications system or an FA (Factory Automation) system to understand all states that may occur. It is this understanding that prohibits states from developing into bugs in a requiremant specification. However, in trying to search all states, it is not practical, due to the calculative quantity, to generate a state tree. This paper provides a means of over coming that obstacle. We think that to be plain as much as possible and hopes to introduce the algorithm which is regarded as the effectiveness which could be known on the experience which was related to Petri Nets including a surrounding theory over past 10 for several years.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Petri Nets / Deadlock / invariants
Paper #	CST97-31
Date of Issue

Conference Information
Committee	CST
Conference Date	1997/11/28(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 Simple Method of Detection for Invariants
Sub Title (in English)
Keyword(1)	Petri Nets
Keyword(2)	Deadlock
Keyword(3)	invariants
1st Author's Name	Yoshihiro UEDA
1st Author's Affiliation	Oki Electric Industry Co., Ltd.()
Date	1997/11/28
Paper #	CST97-31
Volume (vol)	vol.97
Number (no)	404
Page	pp.pp.-
#Pages	6
Date of Issue