Tree Petri Nets: Properties and Applications in Logical Problems

Author

Qing, Cui Huan

Author_Institution

Coll. of Inf. Sci. & Eng., Shandong Univ. of Sci. & Technol., Qingdao, China

Volume

3

fYear

2010

fDate

16-17 Dec. 2010

Firstpage

295

Lastpage

298

Abstract

A special subclass of Petri net, tree Petri net, is discussed. For a tree Petri net, a marking M₁ is reachable from M₂ if and only if M₂ is reachable from M₁ in its inversed Petri net, and the reach ability is equivalent to the state equation satisfiability. Furthermore, two applications of tree Petri nets in logical problems´ analysis are presented. One is applied to the calculation of minimal cut sets of coherent fault tree, the other is used to solve an and-or tree. The corresponding algorithms are given. It is demonstrated that the tree Petri net is effective for failure analysis and artificial intelligence problem solution. Some examples are presented to validate these conclusions.

Keywords

Petri nets; artificial intelligence; computability; fault trees; reachability analysis; set theory; artificial intelligence problem solution; coherent fault tree; failure analysis; inversed Petri net; logical problems; minimal cut sets; reachability; state equation satisfiability; tree Petri nets; Algorithm design and analysis; Analytical models; Equations; Fault trees; Mathematical model; Petri nets; Reliability engineering; Petri net; and-or tree; coherent fault tree; minimal cut set; state equation;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems (GCIS), 2010 Second WRI Global Congress on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-9247-3

Type

conf

DOI

10.1109/GCIS.2010.88

Filename

5709379