State equation, controllability, and maximal matchings of petri nets

1977 ◽  
Vol 22 (3) ◽  
pp. 412-416 ◽  
Author(s):  
T. Murata
Keyword(s):  
1992 ◽  
Vol 32 (8) ◽  
pp. 1083-1090
Author(s):  
R.P. Kaushal ◽  
N. Chammas ◽  
Harpreet Singh

1981 ◽  
Vol 69 (4) ◽  
pp. 466-467 ◽  
Author(s):  
A.A. Khan ◽  
G.S. Hura ◽  
H. Singh ◽  
N.K. Nanda
Keyword(s):  

2003 ◽  
Vol 18 (11) ◽  
pp. 1145-1153 ◽  
Author(s):  
Gi Bum Lee ◽  
Han Zandong ◽  
Jin S. Lee

2009 ◽  
Vol 42 (21) ◽  
pp. 78-83
Author(s):  
Marcos V. Moreira ◽  
Daniel S. Botelho ◽  
João C. Basilio

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Long-long Song ◽  
Tai-yong Wang ◽  
Xiao-wen Song ◽  
Lei Xu ◽  
De-gang Song

A fault tree is established based on structural analysis, working principle analysis, and failure mode and effects analysis (FMEA) of the pantograph-type current collector on the Chinese Rail High-Speed Electric Multiple Unit (CRH EMU) train. To avoid the deficiencies of fault tree analysis (FTA), Petri nets modelling is used to address the problem of data explosion and carry out dynamic diagnosis. Relational matrix analysis is used to solve the minimal cut set equation of the fault tree. Based on the established state equation of the Petri nets, initial tokens and enable-transfer algorithms are used to express the fault transfer process mathematically and improve the efficiency of fault diagnosis inferences. Finally, using a practical fault diagnosis example for the pantographs on CRH EMU trains, the proposed method is proved to be reasonable and effective.


2014 ◽  
Vol 133 (2-3) ◽  
pp. 305-322
Author(s):  
Matthias Werner ◽  
Louchka Popova-Zeugmann ◽  
Mario Haustein ◽  
E. Pelz

1998 ◽  
Vol 08 (01) ◽  
pp. 189-222 ◽  
Author(s):  
JENG S. HUANG ◽  
TADAO MURATA

This paper considers the Petri net reachability problem formulated in terms of nonnegative integer solutions of the state equation and their net representation systems. Our main contributions are twofold. First, we show that algorithms for finding legal transition sequences can be easily given for subclasses of Petri nets where reachability criteria are known or can be formulated by our method. Second, for the general reachability problem where reachability theorems or criteria are not known, and thus an exhaustive search for legal transition sequences is inevitable, we introduce the notion of non-crucial sequences to reduce the search effort.


Sign in / Sign up

Export Citation Format

Share Document