Sokolsky, O., Smolka, S.A.: Incremental model checking in the modal mu-calculus. In: CAV. (1994)  Home/Search   Document Details and Download   Summary   Related Articles   Check

....hint (computing the gcd of one bit numbers) is too trivial to be apparent in the graph. 3.2.2 Incremental Fixpoint Update An alternative to using underapproximations for least fixpoints and overapproximations for greatest fixpoints is to use incremental model checking. Incremental techniques [SS94, Swa96] address the problem of reevaluating a fixpoint after a change in the transition relation. In particular, suppose we wish to evaluate the greatest fixpoint p, in the Kripke structure , using underapproximations defined by hints h 1 and h 2 . From these hints we obtain two ....

....V , 1 E T 2 , and Here, F is the set of fair states of T 2 . It is easily seen that S 1 D T1 T2 (T 1 T 2 has all the edges that appear in both T 1 and T 2 ) because S 1 is an overapproximation of this set. Also, S1W S 2 . Using techniques from [SS94, Swa96] one can prove that S is an overapproximation of S 2 . The basic underlying fact is that a cycle within p either exists in T 1 T 2 , or has an edge in it that is in T 2 but not in T 1 . From S 1 1W4 S 2 it follows that S 1 1 1H S 2 . A dual technique can be used for least ....

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In D. L. Dill, editor, Sixth Conference on Computer Aided Verification (CAV '94), pages 351--363. Springer-Verlag, Berlin, 1994. LNCS 818.

....techniques for incremental attribute grammar evaluation help with incremental model checking for program analysis. Incremental model checking There exists one wellknown incremental model checking algorithm for the modal mu calculus, by Sokolsky and Smolka, that might be useful for our purposes [37]. It is similar to the data ow algorithms that restart iteration referred to above. The formalism employed (modal mu calculus) is however far more powerful than what is needed in our applications; therefore it is likely that a better solution is possible in our setting, which is that of regular ....

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In Proceedings of the 6th International Conference on Computer-aided veri cation, volume 818 of Lecture Notes in Computer Science, pages 351-363. Springer Verlag, 1994.

....checking problem is reduced to the problem of finding a marking for the boolean graph. In this paper, also a local algorithm based on similar techniques is proposed. A global algorithm for alternation free calculus similar to the one in [11] is presented by [23] Similar techniques are adopted by [81] for giving an incremental version of this algorithm, where the goal is of avoiding repeating all the proof, when the system is possibly modified. The main limitation of this algorithmic approach is due to the state explosion problem, since it cannot cope with arbitrary systems whose state space ....

....to time successor, while the other corresponds to transition successor. In this paper, a model checking algorithm is proposed for the alternation free fragment of calculus by assuming the system to be modeled as timed graph. The algorithm is local (on the fly) and exploits the graph techniques of [81, 11]. A Compositional Proof System for The proof system proposed in chapter 6 permits to prove RTL properties of T SP processes by exploiting their timed graph semantics. This approach has the advantage to be local, but is not compositional. Therefore, it is not adequate to be used during the ....

O.V. Sokolski and S.A. Smolka. Incremental Model Checking in the Modal MuCalculus. In Proceedings of CAV 94, volume 818 of Lecture Notes in Computer Science, pages 351--363. Springer-Verlag, Berlin, 1994.

....none of these techniques are tailored specifically for efficient re verification after learning has altered the system (which is the focus of this paper) There are a few methods in the literature that are designed for software that changes. One that emphasizes efficiency, as ours does, is [16]. However none of them (including [16] are applicable to multiagent systems in which a single agent could adapt, thereby altering the global behavior of the overall system. In contrast, our approach addresses the timeliness of adaptive multiagent systems. In our APT agents framework (see Figure ....

....specifically for efficient re verification after learning has altered the system (which is the focus of this paper) There are a few methods in the literature that are designed for software that changes. One that emphasizes efficiency, as ours does, is [16] However none of them (including [16]) are applicable to multiagent systems in which a single agent could adapt, thereby altering the global behavior of the overall system. In contrast, our approach addresses the timeliness of adaptive multiagent systems. In our APT agents framework (see Figure 1) there are one or more agents with ....

[Article contains additional citation context not shown here]

Sokolsky, O. & Smolka, S. (1994). Incremental model checking in the modal mu-calculus. CAV'94.

....hint (computing the gcd of one bit numbers) is too trivial to be apparent in the graph. 3.2.2 Incremental Fixpoint Update An alternative to using underapproximations for least fixpoints and overapproximations for greatest fixpoints is to use incremental model checking. Incremental techniques [SS94, Swa96] address the problem of reevaluating a fixpoint after a change in the transition relation. In particular, suppose we wish to evaluate the greatest fixpoint E C G p, in the Kripke structure (S;T;S 0 ; A;L) using underapproximations defined by hints h 1 and h 2 . From these hints we obtain ....

....0 D) T 2 , and S 000 = E C GS 00 ] T 2 : Here, F is the set of fair states of T 2 . It is easily seen that S 0 = E C G p] T1 T2 (T 1 T 2 has all the edges that appear in both T 1 and T 2 ) because S 1 is an overapproximation of this set. Also, S 0 S 2 . Using techniques from [SS94, Swa96] one can prove that S 00 is an overapproximation of S 2 . The basic underlying fact is that a cycle within p either exists in T 1 T 2 , or has an edge in it that is in T 2 but not in T 1 . From S 00 S 2 it follows that S 000 = S 2 . A dual technique can be used for least fixpoints ....

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In D. L. Dill, editor, Sixth Conference on Computer Aided Verification (CAV '94), pages 351--363. Springer-Verlag, Berlin, 1994. LNCS 818.

....universal ones on a simplified system [23, 22] In particular, underapproximations can be applied to non exhaustive verification. Underapproximations are also instrumental to the efficient computation of least fixpoints [24, 2] In the context of incremental model checking algorithms like those of [26, 28], underapproximations can also be used to speed up the computation of greatest fixpoints [3] Under and overapproximations can be obtained using methods that can be broadly classified into three groups: Changing the formula, changing the model, or changing the computation. In this paper we ....

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In D. L. Dill, editor, Sixth Conference on Computer Aided Verification (CAV '94), pages 351--363. Springer-Verlag, Berlin, 1994. LNCS 818.

....a simple correctness proof and performs extremely well in practice. It is interesting to note that algorithm LAFP correctly evaluates the input PDG for any I, O, and Q satisfying the invariants of given in the proof sketch of Theorem 1. This suggests an incremental approach, along the lines of [SS94] for the local computation of alternating fixed points. The incremental version of LAFP would be invoked after LAFP is run on a PDG that subsequently undergoes a set Delta of changes, where a change is an inserted or deleted PDG edge. After accounting for the immediate effects of Delta on I, ....

O. Sokolsky and S. A. Smolka. Incremental model checking in the modal mucalculus. In D. Dill, editor, Proceedings of the Sixth International Conference on Computer Aided Verification (CAV '94), Vol. 818 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

....mucalculus in terms of checking whether certain linear time temporal formulas are satisfied by generalized Kripke structures that we call and or Kripke structures. 1 Introduction Over the last decade model checking has emerged as a useful technique for automatically verifying concurrent systems. [1, 4, 8, 15, 19]. In this approach, one attempts to determine whether or not a system satisfies a formula that typically comes from a temporal logic. A variety of different temporal logics have been proposed for this purpose [4, 10, 18] one particularly expressive one is the modal calculus [13] which is ....

O. Sokolsky and S. Smolka. Incremental model-checking in the modal mu-calculus. In Dill [9], pages 352--363.

....methodology can be used to generate diagnostic information [CC92] efficiently. It can be used to do model checking efficiently, for various fragments of modal mu calculus. It is naturally local [SW91, Lar92] and it can be made to run both on the fly [VW86, CVWY92, FM91, BCG95] and incrementally [SS94]. Our results show that previous methodologies involving systems of Boolean equations [Lar92, And94] can be simulated by finding maximal and minimal solutions of weakly positive and weakly negative Horn formulas. Since efficient algorithms for finding minimal and maximal satisfying assignments for ....

....incremental solutions, and (v) data structures and algorithms for the efficient solutions of the required HORN satisfiability problems already exist in the literature [DG84, AI91] See Appendices D and E. The desirability of (i) through (iv) for verification algorithms has been widely discussed [VW86, BCG95, CC92, FM91, Lar88, Lar90, CVWY92, CS91, And94, SS94, SW91, Cle90]. However, the solutions proposed in the literature have only some of the advantages of (i) through (iv) and have only been applied to some of the verification problems considered here. Our uniform methodology combines all these advantages in the same solution. Our methodology is based upon ....

[Article contains additional citation context not shown here]

O. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In Proceedings of CAV'94, 1994.

....but our form is simpler (and hence faster) at the expense of some precision. Also, we deal with more general multi valued functions [6] rather than just binary. The techniques presented here can be used to drive the incremental verification algorithms of Swamy et a. l [7] 8] and Sokolosky et al. [9]. These use information about the similarities between two designs to speed up the verification process. 3 Table Matching The nodes in our networkshave discrete valued functions (a generalization of boolean functions) associated with them. These are represented in BLIF MV style tables [6] such as ....

O. Sokolosky and S. Smolka, "Incremental Model-Checking in Modal MuCalculus, " in Proc. of the Conf. on Computer-Aided Verification, vol. 818, pp. 351--363, Springer-Verlag, June 1994.

....procedure is explored. As such, local techniques provide a powerful heuristic for dealing with complex (i.e. large state space) specifications. The Factory is currently equipped with a local model checker for the modal mucalculus; an incremental model checker has also been implemented [SS94] Model checking [CE81, CES86] is the problem of verifying whether a system possesses a property specified by a formula in some temporal logic (in other words, provides a model for Research supported in part by NSF Grants CCR 9120995 and CCR 9208585, and AFOSR Grant F49620 93 1 0250. the ....

.... product of the given logical formula and the transition system induced by the given timed automaton. Each node of this region product graph (RPG) represents the value of a logical variable for some set of timed states, or region. A similar, albeit untimed, product construction is employed in [SS94, And94, EJS93] and in the automata theoretic approach of [VW86, BVW94] The RPG is constructed on the fly using methods similar to [BFH 92, ACH 92] However, rather than viewing regions as sets of states, we treat them as sets of clock constraints and reason directly in these terms. The ....

O. Sokolsky and S. A. Smolka. "Incremental Model Checking in the Modal MuCalculus ". In Proceedings of CAV'94. LNCS 818, 1994.

....the size of the affected set. However, this work was restricted to a limited set of graph theoretic algorithms, and there was no experimental justification offered. In the field of verification, relevant work done concurrently with our research is on incremental model checking in modal mu calculus [32]. They presented an incremental algorithm for model checking in the alternation free fragment of modal mu calculus. They used as starting point the linear time algorithm of Cleveland and Steffen. One of the flaws of this work lay in the relative lack of experimental validation. Our work was done ....

....but our form is simpler (and hence faster) at the expense of some precision. Also, we deal with more general multi valued functions [48] rather than just binary. The techniques presented here can be used to drive the incremental verification algorithms of Swamy et al. [49] 50] and Sokolosky et al. [32]. These use information about the similarities between two designs to speed up the verification process. This chapter is organized as follows. Section 3.2 contains exact and heuristic solutions to the network (structural) matching problem. We present both an exact formulation (Section 3.4) and a ....

O. Sokolosky and S. Smolka, "Incremental Model-Checking in Modal Mu-Calculus," in Proc. of the Conf. on Computer-Aided Verification, vol. 818, pp. 351--363, SpringerVerlag, June 1994.

....for bisimulation equivalence for deterministic transition system (posed as an open problem in [GHR95] an easy algorithm for computing simulations on finite graphs [HHK95] etc. Our approach naturally gives rise to algorithms which are on the fly [VW86, FM91] local [CS91, Lar92] and incremental [SS94] Moreover, diagnostic information [CC92, FM91] can be obtained without any additional complexity overhead in this methodology. 1. Introduction 1.1. Motivation and Results. Different simulation preorders and equivalence relations between processes have been widely considered in various approaches ....

....changed systems with a minimal amount of work. The changes in transitions amounts to changes in clauses in the NHORNSAT instance. The HORNSAT algorithms we use being incremental [AI91] it takes O(q) amortized time to maintain the satisfiability where q is the size of the changes in clauses. In [SS94, SHR96] incremental algorithms for model checking were presented. From our results here, it is easily seen that our methodology naturally gives incremental algorithm for behavioral equivalence checking problem. In [SHR96] we also show how to compute diagnostic information without any overhead in ....

O. Sokolsky and S. A. Smolka, Incremental model checking in the modal mucalculus, Proceedings of CAV'94, 1994.

....[CS93] and a bisimulation checker based on the algorithm of [KS90] Care is being taken to ensure that these algorithms are efficient enough to be used on real life systems. For example, we are investigating how these algorithms can be parallelized [ZS92, ZSS94] and made to perform incrementally [SS94a] ffl A graphical compiler that transforms VTView and VPL specifications into executable code. Our current version produces Facile [GMP89] code, a concurrent language that symmetrically integrates many of the features of Standard ML [Mil84] and CCS [Mil89] We are also considering adding a ....

O. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. To appear in CAV'94, June 1994.

....introduce local model checking. Chapter 6 then builds upon it to exhibit a local algorithm for verification of real time systems. Finally, Chapter 7 concludes and discusses possible directions of further work. Parts of Chapter 2 were adapted from [22] Results of Chapter 4 were first reported in [69] and those of Chapter 6, in [70] Chapter 2 The Concurrency Factory Project 2.1 Main Features and Design Goals The Concurrency Factory is an integrated toolset for specification, simulation, verification, and implementation of concurrent systems such as communication protocols and process ....

O. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In Proceedings of CAV'94. LNCS 818, 1994.

No context found.

Sokolsky, O., Smolka, S.A.: Incremental model checking in the modal mu-calculus. In: CAV. (1994)

No context found.

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In D. L. Dill, editor, Proceedings of the 6th International Conference on Computer-aided verification, volume 818 of Lecture Notes in Computer Science, pages 351--363. Springer Verlag, 1994.

No context found.

O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In D. L. Dill, editor, Sixth Conference on Computer Aided Veri cation (CAV '94), pages 351-363. Springer-Verlag, Berlin, 1994. LNCS 818.

No context found.

O. Sokolsky and S. A. Smolka, Incremental model checking in the modal mu-calculus, Proceedings of CAV'94, 1994.

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