Stepwise CTL Model Checking of State/Event Systems

Abstract. We introduce a SAT based automatic abstraction refinement framework for model checking systems with several thousand state variables in the cone of influence of the specification. The abstract model is constructed by designating a large number of state variables as invisible. In contrast to previous work where invisible variables were treated as free inputs we describe a computationally more advantageous approach in which the abstract transition relation is approximated by pre-quantifying invisible variables during image computation. The abstract counterexamples obtained from model-checking the abstract model are symbolically simulated on the concrete system using a state-of-the-art SAT checker. If no concrete counterexample is found, a subset of the invisible variables is reintroduced into the system and the process is repeated. The main contribution of this paper are two new algorithms for identifying the relevant variables to be reintroduced. These algorithms monitor the SAT checking phase in order to analyze the impact of individual variables. Our method is complete for safety properties (AG p) in the sense that -performance permitting -a property is either verified or disproved by a concrete counterexample. Experimental results are given to demonstrate the power of our method on real-world designs.

show abstract

“…[1,14]). Localization reduction begins with the set of variables in the property as visible variables.…”

Section: Related Workmentioning

confidence: 99%

Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis

Chauhan

Clarke

Kukula

et al. 2002

Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…This led to the introduction of an interface layer named abstraction refinement aiming at iteratively refining an initial coarse abstraction until the specification is satisfied on the obtained refined abstraction. This topic has been extensively studied in the context of model checking for hardware design, thus primarily focused on verification problems (as opposed to control synthesis) for large but finite systems [16], [23], [17], with the most popular approach being based on CounterExample-Guided Abstraction Refinement (CEGAR) [8], [4], [3], [12]. Later work then also considered control problems [13], [10] and infinite systems [7], [6], [27], [9].…”

Section: Introductionmentioning

confidence: 99%

Compositional abstraction refinement for control synthesis under lasso-shaped specifications

Meyer

Dimarogonas

2017

2017 American Control Conference (ACC)

View full text Add to dashboard Cite

Abstract-This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to overapproximate its reachable sets. The control specification consists in following a lasso-shaped sequence of regions of the state space. The dynamics are decomposed into subsystems with partial control, partial state observation and possible overlaps between their respective observed state spaces. A finite abstraction is created for each subsystem through a refinement procedure, which starts from a coarse partition of the state space and then proceeds backwards on the lasso sequence to iteratively split the elements of the partition whose coarseness prevents the satisfaction of the specification. The composition of the local controllers obtained for each subsystem is proved to enforce the desired specification on the original system. This approach is illustrated in a nonlinear numerical example.

show abstract

“…These can potentially be combined with our techniques based on model checking to derive and/or solve embedded constraints in the testbench. Finally, the details of our analysis technique are similar to other efforts in the area of abstraction, approximate model checking, and refinement [4,10,11,12,13]. A discussion of these is deferred to Section 2, where our techniques are described in detail.…”

Section: Related Workmentioning

confidence: 99%

“…Again, we use explicit traversal over the control states to identify datapath dependencies for ranking these candidates and abstracting them. The resulting model constitutes an upper bound approximation of the underlying Kripke structure [10,11,12,13].…”

Section: Initial Abstract Modelmentioning

confidence: 99%

“…Our abstraction technique and mc_for_sim algorithm are similar to other works in the area of abstraction and approximate model checking [4,11,12,13]. Like many of these efforts, we also use an "existential" abstraction which preserves the atomic propositions, and also allows us to compute overapproximations of satisfying states (sets upper).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation