Minimizing Counterexample of ACTL Property
نویسندگان
چکیده
Counterexample minimization tries to remove irrelevant variables from counterexamples, such that they are easier to be understood. For the first time, we proposes a novel approach to minimize loop-like and path-like counterexamples of ACTL properties. For a counterexample s0 . . . sk, our algorithm tries to extract a succinct cube sequence c0 . . . ck, such that paths run through c0 . . . ck are all valid counterexamples. Experimental result shows that our algorithm can significantly minimize ACTL counterexamples. 1
منابع مشابه
On ACTL Formulas Having Linear Counterexamples
In case an ACTL formula fails over a transition graph M , it is most useful to provide a counterexample, i.e., a computation tree of M witnessing the failure. If there exists a single path in M which by itself witnesses the failure of , then has a linear counterexample. We show that, given M and , where M 6j= , it is NP-hard to determine whether there exists a linear counterexample. Moreover, i...
متن کاملOn Actl Formulas Having Deterministic Counterexamples
In case an ACTL formula fails over a labeled transition graph M, it is most useful to provide a counterexample, i.e., a computation tree of M witnessing the failure. If there exists a single path in M which by itself witnesses the failure of , then has a deterministic counterexample. We show that, given M and , where M 6 j = , it is NP-hard to determine whether there exists a deterministic coun...
متن کاملCounterexample Minimization for ACTL
Counterexample minimization is a hot research topic, which tries to remove irrelevant variables from counterexamples, such that they are easier to be understood. Existing approaches can only deal with path-like counterexamples of invariant AG f . For the first time, this paper proposes a novel approach to minimize loop-like and path-like counterexamples of ACTL properties. For a counterexample ...
متن کاملDesign Verification Based on All Counterexamples
Today up to 80% of the design costs for integrated circuits are due to verification therefore verification is an important part of design. Formal verification is the process of checking whether a design satisfies some requirements (properties).Verification tools guarantee completeness if properties for a design are proven. In the other case usually one counterexample produced. Then debugging ha...
متن کاملWitness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a validity or a failure. Our work in this area is motivated by the application of action-based model checking a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005