Analysis of the problem description in the Algorithm for Inventive Problem Solving using Petri nets

uTaipei > College of Science > Department of Computer Science > Periodical Articles > Item 987654321/16004

Please use this identifier to cite or link to this item: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/16004

Title:	Analysis of the problem description in the Algorithm for Inventive Problem Solving using Petri nets
Authors:	Shen, Victor R.L.;Yang, Cheng-Ying;楊政穎;Lee, Jia-Hong
Contributors:	臺北市立教育大學資訊科學系
Keywords:	Petri net;TRIZ;ARIZ;Markov chains;EARIZ
Date:	2012-11
Issue Date:	2017-07-31 13:35:34 (UTC+8)
Abstract:	The Theory of Inventive Problem Solving (TRIZ) has been widely employed in the fields of business and industry. The degree of difficulty in a problem usually depends on its description and degree of standardization. Using an appropriate description and maintaining standardization can minimize the scope of the problem and significantly increase the likelihood of resolving it successfully. Most problems can be resolved easily with innovative principles and standard resolutions. However, non-standard complex invention problems must be analyzed and resolved using the Algorithm for Inventive-Problem Solving (ARIZ), which contains numerous systematic tools of the TRIZ. This study applies the behavioral properties of a Petri net to the description of a problem to establish a problem model and perform scenario analysis. When describing the problem, the developer was provided with suitable directions of thinking or with wrong messages for reference. To create more specific effects on the varied problem models and scenario analyses of the TRIZ, this study combines the TRIZ with Petri nets and Markov chains to help new learners of TRIZ or professional researchers obtain appropriate resolutions rapidly.
Relation:	Knowledge-Based Systems，Vol. 35，P.290-303
Appears in Collections:	[Department of Computer Science] Periodical Articles

Files in This Item:

There are no files associated with this item.

Loading...