E.M. Clarke, R. Enders, T. Filkorn, and S. Jha, \Exploiting Symmetries in Temporal Logic Model Checking," Formal Methods in System Design, vol. 9, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....most cases, the available computer memory. This has lead to the development of a wide range of state space reduction methods capable of reducing the memory required to conduct state space exploration. Partial order methods [14,16,19] explore a subset of the state space, whereas the symmetry method [2] and symbolic methods based on Binary Decision Diagrams (BDDs) 12] provide a compact representation of the state space. Another main paradigm is that of compositional state space veri cation [17] In this paradigm, systems are speci ed as a parallel composition of subcomponents, and the state ....

E. M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. In Proc. of CAV'93, pages 450-462. Springer-Verlag, 1993.

....memory is used when the search is finished. But the execution time is considerably reduced, because it is not necessary to put a copy of the state on the stack anymore. 2. 4 Exploiting Symmetries Symmetries have been used in model checking to reduce the size of the state space [EJ93,ID96,CEJS98,CFJ93,BDH00] The basic idea is to visit a subset of the state space that is representative of the whole state space based on a symmetry relation that does not influence the properties being checked. Typically symmetry reductions exploit the structure of the system being analyzed, e.g. identical ....

Edmund M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetries in temporal logic model checking. In Proc. of the 5th International Conference on Computer Aided Verification, volume 697 of LNCS. Springer-Verlag, 1993.

....In an attempt to alleviate the state explosion problem a number of state space reduction methods and techniques have been developed. These techniques can be split into three main classes. The rst are those methods that represent the state space in a compact or condensed form. Symmetry reduction [4, 5, 13] is an example of this, where a representative state is used to represent a set of symmetric states. The second class of methods represent only a subset of the full state space. Such methods include partial order reduction methods [17, 20, 21] Supported by an Australian Research Council (ARC) ....

E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9(1/2):77-104, 1996.

....has been investigated in [17] Recently [2] heuristics for deleting states based on structural techniques of Petri Nets have been developed for partial state space exploration. Other examples of state space reduction methods are partial order reduction methods [22,24,27] and the symmetry method [6, 7, 15]. The novelty of the sweep line method is the intriguingly simple idea of exploiting a certain kind of progress exhibited by many concurrent systems. Exploiting progress makes it possible to investigate the full state space of the system, while only storing small fragments of the state space in ....

E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9(1/2):77-104, 1996.

....created them. Hence, to obtain veri cation results, properties must be checked on the y. Since the sweep line method visits all reachable states it is ideal for checking safety properties. 4 Equivalence Reduction The equivalence reduction method [12] is a generalisation of the symmetry method [9, 10, 13]. The basic idea behind equivalence reduction is to group equivalent states into equivalence classes and construct a state space of the equivalence classes rather than the original states. This reduced state space can then be used to verify properties compatible with the equivalence relation. In ....

E. M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9, 1996.

....most cases, the available computer memory. This has lead to the development of a wide range of state space reduction methods capable of reducing the memory required to conduct state space exploration. Partial order methods [13,16,19] explore a subset of the state space, whereas the symmetry method [2] and symbolic methods based on Binary Decision Diagrams (BDDs) 11] provide a compact representation of the state space. Another main paradigm is that of compositional state space veri cation [17] In this paradigm, systems are speci ed as a parallel composition of subcomponents, and the state ....

E. M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. In Proc. of CAV'93, pages 450-462. Springer-Verlag, 1993.

....nmetI ds are part ial order reductP nmetI ds [19, 21, 22] t. symmet y Supported by the Danish Natural Science Research Council. T. Margaria and W. Yi (Eds. TACAS 2001, LNCS 2031, pp. 450 464, 2001. c Springer Verlag Berlin Heidelberg 2001 Methodf or State Space Exploration 451 metk d [5,6,14], and t. unfolding met. d [7,17] Reductk nmetF ds represent tn full s t t space in a compact or condensed form, or represent only a subset oft he fullst t e space.The reductA n is done suchtP t tP answert ot he verificat ion quest3 ns can stHN bedetI mined fromtP reducedst t e space. Reduct ion ....

....t herefore needst o be breadt h first based in ordert o be compat ible wit ht he sweep line metF d. FutHH work also includes investP3.RP3 t he combinat3H of tN sweep line metD d and ot her s t t space reductH nmetP ds such as partN l order reduct ion met hods [21, 19,22] andt he symmet ry met hod [6, 14,5]. The sweep line metA d is gearedt owardssystPA for which it is possiblet o quant ify it s progress based ont he st at es.The met hod does not work well for fully or almost fullyreact ivesyst ems, where most oft hest at e space isst rongly connectkI i.e. t hestHk space has very fewstPA3N3 connect. ....

E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9, 1996.

....is used when the search is finished. But the execution time is considerably reduced, because it is not necessary to put a copy of the state on the stackanymore. 2. 4 Exploiting Symmetries Symmetries have been used in model checking to reduce the size of the state space [EJ93] ID96] CEJS98] CFJ93] BDH00] The basic idea is to visit a subset of the state space that is representative of the whole state space based on a symmetry relation that does not influence the properties being checked. Typically symmetry reductions exploit the structure of the system being analyzed, e.g. identical ....

Edmund M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetries in temporal logic model checking. In Proc. of the 5th International Conference on Computer Aided Verification,volume 697 of LNCS. SpringerVerlag, 1993.

....of designs. A large set of designs incorporate symmetry. For certain classes of properties, verification of the invariant at a particular state ensures its correctness at all symmetrically equivalent states. Various researchers have exploited this fact to reduce the complexity of verification [1, 2, 3]. We proved the existence of an exponential lower bound on the size of BDDs needed to represent the reached state sets of completely symmetric systems; this provides theoretical justification for using explicit state enumeration. We also developed heuristic symmetry reduction procedures (the need ....

....bound on the size of BDDs needed to represent the reached state sets of completely symmetric systems; this provides theoretical justification for using explicit state enumeration. We also developed heuristic symmetry reduction procedures (the need for such procedures was stressed by Clarke et al. [1]) Another contribution is the interpretation of the theory of symmetries for designs specified as netlists. We have implemented the procedures described in this paper, and experimented with examples incorporating various degrees of symmetry. We also compared explicit and symbolic (BDD based) ....

[Article contains additional citation context not shown here]

E. M. Clarke, T. Filkorn, and S. Jha, "Exploiting Symmetries in Temporal Logic Model Checking," in Proc. of the Computer Aided Verification Conf., 1995.

No context found.

E.M. Clarke, R. Enders, T. Filkorn, and S. Jha, \Exploiting Symmetries in Temporal Logic Model Checking," Formal Methods in System Design, vol. 9, 1996.

No context found.

E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetries in temporal logic model checking. In Proc. 5th International Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science. Springer-Verlag, 1993.

No context found.

E. M. Clarke, E. A. Emerson, S. Jha, and A. P. Sistla. Exploiting symmetries in temporal logic model checking. In Proc. 5th International Conference on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 147--158. Springer-Verlag, 1998.

No context found.

E.M. Clarke, R. Enders, T. Filkorn, and S. Jha, Exploiting Symmetries in Temporal Logic Model Checking, Formal Methods in System Design 9 (1996).

No context found.

E.M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. In Proceedings of CAV'93, LNCS, pages 450-462. Springer-Verlag, 1993.

No context found.

E. M. Clarke, T. Filkorn, and S. Jha, "Exploiting Symmetries in Temporal Logic Model Checking," in Proc. of the Computer Aided Verification Conf., 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC