Integrating low level symmetries into reachability analysis

被引：0

作者：

Schmidt, K ^{[1
]}

机构：

[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany

来源：

TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS | 2000年 / 1785卷

关键词：

symmetries; automorphisms; reachability analysis;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present three methods for the integration of symmetries into reachability analysis. Two of them lead to maximal reduction but their runtime depends on the symmetry structure.The third one works always fast but does not always yield maximal reduction.

引用

页码：315 / 330

页数：16

共 18 条

[1] Chiola G, 1998, LECT NOTES COMPUT SC, V1420, P28
[2] CHIOLA G, 1994, LNCS, V815, P139
[3] Exploiting symmetry in temporal logic model checking
Clarke, EM
Enders, R
Filkorn, T
Jha, S
[J]. FORMAL METHODS IN SYSTEM DESIGN, 1996, 9 (1-2) : 77 - 104
[4] DURI S, 1993, ACM P 1993 INT S SOF, P51
[5] Symmetry and model checking
Emerson, EA
Sistla, AP
[J]. FORMAL METHODS IN SYSTEM DESIGN, 1996, 9 (1-2) : 105 - 131
[6] EMERSON EA, 1997, LECT NOTES COMPUT SC, V1217, P19
[7] HUBER A, 1984, LECT NOTES COMPUTER, V188, P215
[8] Ip CN, 1996, FORM METHOD SYST DES, V9, P41, DOI 10.1007/BF00625968
[9] JENSEN K, 1992, EATCS MONOGRAPHS THE, V1
[10] Jensen K, 1995, Coloured Petri nets: basic concepts, analysis methods and practical use, V2

← 1 2 →