学术探索
学术期刊
新闻热点
数据分析
智能评审

ENUMERATION OF ALL 2-TREES IN A GRAPH THROUGH PETRI NETS

被引：2
作者：
HURA, GS
机构：
来源：
MICROELECTRONICS AND RELIABILITY | 1983年 / 23卷 / 05期
关键词：
D O I：
10.1016/0026-2714(83)91011-9
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：851 / 853
页数：3
相关论文
共 7 条
[1]   MODIFICATION OF TOPOLOGICAL FORMULAS [J].
CHAN, SP ;
CHAN, SG .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1968, CT15 (01) :84-&
[2]   A PETRI NET APPROACH TO ENUMERATE ALL SYSTEM SUCCESS PATHS FOR RELIABILITY EVALUATION OF A COMPLEX SYSTEM [J].
HURA, GS .
MICROELECTRONICS AND RELIABILITY, 1982, 22 (03) :427-428
[3]   ON THE DETERMINATION OF ALL TIE SETS AND MINIMAL CUT SETS BETWEEN ANY 2 NODES OF A GRAPH THROUGH PETRI NETS [J].
HURA, GS .
MICROELECTRONICS AND RELIABILITY, 1983, 23 (03) :471-475
[4]   SIMPLIFICATION OF BOOLEAN FUNCTIONS THROUGH PETRI NETS [J].
HURA, GS .
MICROELECTRONICS AND RELIABILITY, 1983, 23 (03) :467-470
[5]  
MAYEDA W, 1957, U ILL B, V55
[6]   STATE EQUATION, CONTROLLABILITY, AND MAXIMAL MATCHINGS OF PETRI NETS [J].
MURATA, T .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1977, 22 (03) :412-416
[7]  
RAO KS, 1970, ELECTRONICS LETT, V6, P835
1