1996
DOI: 10.1007/bf00625969
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting symmetry in temporal logic model checking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
146
0

Year Published

1998
1998
2016
2016

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 261 publications
(150 citation statements)
references
References 7 publications
1
146
0
Order By: Relevance
“…In hardware verification, techniques with the same goal exist and usually work by altering these BDDs during the search. Some of these techniques try to exploit special structures in the circuits, such as symmetries [27] or asynchrony [28]. Because our models lack these special structures, these techniques are not applicable.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…In hardware verification, techniques with the same goal exist and usually work by altering these BDDs during the search. Some of these techniques try to exploit special structures in the circuits, such as symmetries [27] or asynchrony [28]. Because our models lack these special structures, these techniques are not applicable.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…We want to be able to restrict the test process to subautom ata of specification and imple m entation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2,8,10,11,12,18], such subautom ata are constructed for explicitly given FSMs by identifying and collapsing symmetrical states. We are concerned with black box testing, and, by definition, it is impossible to refer directly to the states of a black box.…”
Section: Symmetrymentioning
confidence: 99%
“…The state space is reduced by considering global states equivalent that are identical up to applications of structure automorphisms, for example permutations that interchange the identities of participating components. This equivalence, the orbit relation, gives rise to a bisimilar quotient structure over the equivalence classes (orbits) [ES96,CEFJ96].…”
Section: Introductionmentioning
confidence: 99%
“…Disappointingly, it was discovered that symbolic representation using BDDs, by then becoming a standard in large-scale system verification, seemed not to combine favorably with symmetry reduction [CEFJ96]. The reason is that the BDD for the orbit relation is provably intractably large.…”
Section: Introductionmentioning
confidence: 99%