K. Fisler and M. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In Formal Methods in Computer-Aided Design (FMCAD), pages 115-- 132, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....even when they do not have successors in the same classes. Thus, our analysis is more complicated and requires both Sigma i and H i . Symbolic bisimulation minimization is suggested in [BdS92] In [BFH90] a minimized structure with respect to bisimulation is generated directly out of the text. In [FV98] a bisimulation minimization is applied to the intersection of the system automaton and the specification automaton. The algorithm from [LY92] is used. Several works minimize a structure in a compositional way, preserving language containment [ASSB94] or a given CTL formula [ASSSV94] Minimizing ....

K. Fisler and M. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In CAV 98 papers, 1998.

....we saw, language containment is reduced to checking emptiness of a system AM; or AM;P ) that combines the design with the complement of the property. Thus, one can search for abstractions that are tailored to the specific property being checked, resulting in more dramatic state space reductions [38]. Combined methods: Nonemptiness of automata can be tested enumeratively [25] or symbolically [97] Recent work has shown that for invariances enumerative and symbolic methods can be combined [89] Since in the linear framework model checking of general safety properties can be reduced to ....

K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In G. Gopalakrishnan and P. Windley, editors, Proc. Intl. Conference on Formal Methods in Computer-Aided Design (FMCAD), number 1522 in Lecture Notes in Computer Science, pages 115--132. Springer-Verlag, 1998.

....the initial partition. The boxes in the third diagram show the final equivalence classes. The minimized system appears on the far right. we showed experimentally that using bisimulation minimization as a pre processing phase to model checking does reduce the resource requirements of model checking [22]. However, our work also showed that the cost of performing bisimulation minimization often significantly exceeds that of model checking. It is therefore unclear that performing bisimulation minimization before model checking saves resources over simply model checking the original system. ....

....than the individual equivalence classes. The BDD for the relation requires twice as many variables as the BDDs for the classes. This can lead to BDD explosion even on small examples. Experimental work confirms that the BDDs used to compute the bisimulation relation do get overly large in practice [10, 22], which suggests that computing bisimulation relations is not a feasible approach to algorithmic state space reduction. The algorithms considered in this paper compute the equivalence classes instead of the relation. As we have argued in previous work [22] this makes a significant difference in ....

[Article contains additional citation context not shown here]

Fisler, K. and M. Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In Gopalakrishnan, G. and P. Windley, editors, Proc. Intl. Conference on Formal Methods in Computer-Aided Design (FMCAD), number 1522 in Lecture Notes in Computer Science, pages 115--132. Springer-Verlag, 1998.

....the definition in [17] which improves [52] by being demand driven; that is, the state space of A: is restricted to states that are reachable from the initial state. See [31] for a more through analysis of the relationship between LTL and CTL model checkers. See also experimental work in [16], which confirms this analysis. Example 13. Consider the LTL formula = G( p X:p) Note that A is equivalent to the CTL formula A = AG( p AX:p) A standard CTL model checkers proceeds in three phases. In the first phase the model checker captures the set of states that satisfy AX:p, i.e. that ....

K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework. Unpublished manuscript, 1998.

....must, however, be safe: verification in the abstract model must carry over to the concrete model. More formally, the abstraction must preserve the truth A shorter version of this paper appeared in the proceedings of the International Conference on Formal Methods in ComputerAided Design [17]. y Supportedin part by NSF grants CDA 9625898, CCR 9628400 and CCR 9700061, and by a grant from the Intel Corporation. or falsehood of the properties of interest. Abstractions preserving both truth and falsehood provide strong preservation, while those preserving only truth provide weak ....

K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In Proc. Intl. Conference on Formal Methods in Computer-Aided Design (FMCAD), 1998.

....XIII better on the DesignProp automata in terms of live nodes (12 better on average, as high as 25 on several examples) The results are mixed for the design minimizations. The actual figures and other details on the new algorithm are available in a technical report version of this paper [17] and on our web site (http: www.cs.rice.edu CS Verification ) 6 A Comparison to Model Checking We evaluate the utility of our minimizations by comparing model checking on minimized systems to model checking on the original designs. We used the VIS CTL model checker to test properties on the ....

K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework (extended version). Technical report, Rice University, Department of Computer Science, 1998.

No context found.

K. Fisler and M. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In Formal Methods in Computer-Aided Design (FMCAD), pages 115-- 132, 1998.

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