Minimal Counterexample Generation for SPIN
نویسندگان
چکیده
We propose an algorithm to compute a counter-example of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nested breadth-first searches guided by a priority queue. It works in time O(n log n) and is linear in memory.
منابع مشابه
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster than SPIN does. In particular it still works in linear time. Compared with SPIN’s algorithm, it requires only one additional bit per state stored. We further propose another algorithm to compute a counterexample of minimal s...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملGenerating Diagnoses for Probabilistic Model Checking Using Causality
One of the major advantages of model checking over other formal methods of verification is its ability to generate an error trace when the specification is falsified in the model. We call this trace a counterexample. In probabilistic model checking (PMC), counterexample generation has a quantitative aspect. The counterexample is a set of paths in which a path formula holds, and their accumulate...
متن کاملCounterexample Generation for Incomplete Designs
Counterexample generation is a crucial task for error diagnosis and debugging of sequential circuits. The simpler a counterexample is – i.e. more general and fewer assigned input values – the better it can be understood by humans. We will use the concept of Black Boxes – parts of the design with unknown behavior – to mask out components for counterexample computation. By doing this, the resulti...
متن کاملStudying the process of transformation of the start-up to the academic spin off
At todaychr('39')s universities, we are witnessing the emergence of startup companies by the startup teams by student and academic teams; unfortunately, most startups face barriers to success. On the one hand, one of the new topics entering the fourth-generation universities and can be a good target for the future of the startups; the existence of academic spin-offs, centered around scholars...
متن کامل