Bensalem S., Bouajani A., Loiseaux C. and Sifakis J. [1992], Property preserving simulations, in G. V. Bochmann and D. K. Probst, eds, `Proc. 4th Int. Conf. on Computer Aided Veri cation (CAV '92)'.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....invoked. 1 Introduction A traditional problem in the veri cation of concurrent systems is the following: given two processes A and B, does B simulate A [Mil71] The resulting simulation ordering has numerous practical motivations, both in its own right as a re nement approximation ordering [BBLS92,DGG97,Jon91,LV95] and as a vehicle on which to base the de nitions of other re nement orderings [BHR84,DNH83] Indeed, ecient algorithms for computing the simulation ordering underpin algorithms for computing relations such as trace inclusion and the failures must preorder [CH93] Despite its ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In G.v. Bochmann and D.K. Probst, editors, Computer Aided Veri cation (CAV '92), volume 663 of Lecture Notes in Computer Science, pages 260-273, Montreal, June/July 1992. Springer-Verlag.

....is unmanageably large. Consequently, descriptions that can be model checked are limited to relatively small, low complexity designs. There have been various approaches to this problem aimed at di erent points of the model checking process. Some have tried to resolve the problem by abstraction [BBLS92, GL93, CGL91] where irrelevant information is abstracted away from the state space, and consequently, the number of reachable states is reduced. Another approach is symbolic model checking [CBM89, BCM 90, TSL 90] where a large number of states may be eciently represented by a small data ....

A. Bouajjani, S. Bensalem, C. Loiseaux, and J. Sifakis. Property preserving simulations. In 4th Workshop on Computer-Aided Veri caton, June 1992.

....to our own, is that of abstract interpretation. The technique of abstract interpretation has been used successfully for many years now for the analysis of sequential programs [55, 1] More recently, this approach has been applied to reactive systems and, in particular, labelled transition systems [9, 23, 28, 26]. The idea being that enough structure of some transition systems can sometimes be preserved after abstracting, or collecting together, certain labels. By enough structure we mean a level of structural information which still allows the property which one is interested in to be verified. The clear ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In Proceedings of the Workshop on Computer-Aided Verification, volume 663 of Lecture

....process (N 2 ;n2 (V ) in Example 4) 6 Conclusions In this paper we have presented an approach to the problem of the reduction of the number of states of a transition system. Many abstraction criteria for system speci cations not including time constraints have been de ned, see for example [4, 6, 9, 11, 12]. For real time systems the work [17] de nes abstractions for transition systems with quantitative labels, but there, the abstraction is not driven by the property to be proved. We have introduced an abstract semantics for ASTP processes in order to formally de ne the abstract transition system. ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of Workshop on Computer Aided Verication (CAV'92), Lecture Notes in Computer Science 663, 1992. 260-273.

....as a side effect of data abstraction [6, 7, 11] Many works can be found in the literature aiming at state reduction for systems in which the most important part is their concurrent structure: they can be roughly divided into three categories. The works in the first category (see, for example, [1, 27]) that we can denote as following a standard semantics approach, start from generating the standard transition system corresponding to a concurrent system, and then reduce it obtaining a transition system with fewer states. Such approach requires a lot of memory to store the standard transition ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of the Fourth Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science 663, 1992. 260-273.

....1, which has 6 states and 13 transitions. 5 Conclusions In this paper we have presented an approach to the problem of the reduction of the number of states of a transition system. Many abstraction criteria for system specifications not including time constraints have been defined, see for example [4, 6, 9, 11, 12]. For real time systems the work [17] define abstractions for transition systems with quantitative labels, but there the abstraction is not driven by the property to be proved. We have introduced an abstract semantics for ASTP processes in order to formally define the abstract transition system. ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science 663, 1992. 260--273.

....semantics. Other works can be found in the literature aiming at state space reduction for systems in which the most important part is their concurrent structure. They essentially follow either a standard semantics approach or a syntactic approach. Methods in the first category (see, for instance, [1, 19]) start from generating the standard transition system corresponding to a concurrent system, and then reduce it obtaining a transition system with fewer states. Such approach is very general, but it requires a lot of memory to store the standard transition system and effort to apply the reduction ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of the Fourth Workshop on Computer Aided Verification, 1992.

....methodology for ACTL # properties. Abstraction techniques for various fragments of CTL # have been discussed in [36, 37] These abstraction techniques have been extended to the calculus [35, 74] Abstraction techniques for infinite state systems are crucial for successful verification [2, 7, 71, 77]. Graf and Sadi [54] have proposed predicate abstraction techniques to abstract an infinite state system into a finite state system. Later, a number of optimization techniques have been developed in [8, 38] Sadi and Shankar have integrated predicate abstraction into the PVS system which could ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Computer-Aided Verification, July 1992. 144

....These rules can be used to decompose a large model checking problem into smaller ones. 1. 3 Abstraction and Model Checking Abstraction has been studied in the context of model checking as a technique for reducing in nite state or large nite state models to nite state models of manageable size [BBLS92,Kur94,CGL94,LGS 95,Dam96,BLO98] Some of the work on abstraction is based on data abstraction where a variable X over a concrete datatype T is mapped to a variable x over an abstract type t. For example, a variable over the natural numbers could be replaced by a boolean variable ....

Saddek Bensalem, Ahmed Bouajjani, Claire Loiseaux, and Joseph Sifakis. Property preserving simulations. In Computer-Aided Verication, CAV '92, volume 630 of Lecture Notes in Computer Science, pages 260-273, Montreal, Canada, June 1992. Springer-Verlag. Extended version available with title \Property Preserving Abstractions.". 13

....deal with various restricted classes of in nite state systems, as well. Abstraction techniques are one general approach [CC77] to handle large and especially in nite systems which allows to infer properties of a concrete system by examining a more abstract and in general smaller one (see e.g. BBLS92, Lon93, CGL94, DGG93, Dam96] Both systems are connected by an abstraction relation which is called safe with respect to a given property, if it preserves satisfaction of the property. This means, whenever the property holds for the abstract system, it holds for the concrete one as well. A ....

A. Bouajjani, S. Bensalem, C. Loiseaux, and J. Sifakis. Property preserving simulations. In G. v. Bochmann and D. K. Probst, editors, Computer Aided Verication 1992, volume 663 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

....containing only the parts which influence the property . Thus a solution to state explosion is the definition of suitable abstraction criteria by means of which a reduced transition system can be obtained, which abstracts from the parts not concerned with the property to be verified. The works [3, 22, 24, 25, 26, 28, 29] deal with abstractions of transition systems preserving only properties expressible by sub languages of a general temporal logic language, for example avoiding the use of some operators. The works [1] and [10] present methods for constructing reduced transition systems, where the reduction is ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of Workshop on Computer Aided Verification (CAV'92), LNCS 663, 1992. 260--273.

....an equivalence relation preserves the property to be checked, we can, in general, find a smaller transition system equivalent to the original one, to check the property more efficiently. A good discussion about these approaches can be found in [28] Many works have been done following this line. [5, 8, 15, 22, 25, 27] deal with abstractions of transition systems preserving properties expressible by fragments of a temporal logic (for example avoiding the use of some operators) In [1] given a CTL formula, an equivalence based on it is defined. While this last approach has the advantage of introducing a coarser ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science 663, 1992. 260--273.

....was derived in attempting to automate the methodology presented. Thus our work can be seen as providing a general formal framework to practical techniques for process abstraction. Moreover, the obtained reductions are driven by the temporal logic formulae to be checked. Other related works are [6, 8, 26], which deal with abstractions of transition systems preserving properties expressible in fragments of a general temporal logic language, for example avoiding the use of some operators. Our approach differs from these ones since our abstraction is formuladriven, i.e. the abstraction can be ....

S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science 663, 1992. 260--273.

No context found.

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In CAV'92. LNCS 663, 1992.

....simulation framework, nothing is said about how to compute a simulation. Only in the context of strong preservation (the property holds on the abstract system if and only if it holds on the concrete one) by bisimulation [Mil80] computation of abstract systems had initially been proposed. In [BBLS92,LGS 95] we have shown that any simulation relation ae between a set of concrete and abstract states can be represented in the abstract interpretation framework by taking the pair of associated image functions (post[ae] wp[ae] as the corresponding Galois connection, and the other way round, ....

A. Bouajjani, S. Bensalem, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Workshop on Computer-Aided Verification (CAV), Montr 'eal. LNCS 630, June 1992.

....on a simpler system which is an abstraction of it. We show also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed verification method. This is a revised version of the papers [2] and [16] the results are fully developed in [28] Keywords: abstract interpretation, simulation, property preservation, model checking. 1. Introduction The growing complexity of distributed and reactive systems requires rigorous development methodologies and automatic verification techniques. ....

A. Bouajjani, S. Bensalem, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Workshop on Computer-Aided Verification (CAV), Montr'eal. LNCS 630, June 1992.

....of one of two following forms: a ffl) where a 2 M , or (a 1 Delta Delta Delta am ) where a 1 ; am 2 M . 3 This approach can also be applied for branching time properties expressed in universal positive fragments of temporal logics or calculi like 8CTL [16] or 2L [2]. 9 A simple product p over M is either ffl (denoting the language ffflg) or a concatenation e 1 Delta e 2 Delta Delta Delta e n of atomic simple expressions over M . A simple regular expression (SRE) r over M is either ; denoting the empty language) or a sum p 1 Delta Delta Delta ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In 4th Intern. Conf. on Computer Aided Verification (CAV'98). LNCS 663, June 1992.

.... Delta Delta Delta pn is said to be normal if 8i 2 f1; ng: p i is normal, and 8i; j 2 f1; ng: i 6= j: p i 6v p j . 3 This approach can also be applied for branching time properties expressed in universal positive fragments of temporal logics or calculi like 8CTL [16] or 2L [2]. 9 It can be shown that for each SRE r, there is a unique (up to commutativity of products) normal SRE, denoted r, such that [ r] r] and which can be derived from r in quadratic time [1] Finally, we can show that, for a lossy channel system L and an SRE representable set of ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In CAV'92. LNCS 663, 1992.

.... does not satisfy Pi, this could be due to the fact that the abstraction corresponding to the partition of Reach(L) according to the 1 This approach can also be applied for branching time properties expressed in universal positive fragments of temporal logics or calculi like 8CTL [GL91] or 2L [BBLS92] 18 control states is too coarse. Then, one could try to check Pi on refinements of this partition. 8 The tool Lcs We implemented our techniques in a tool prototype called Lcs. The input of the Lcs is a finite set of communicating automata, given separately. Then, the tool allows the ....

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In CAV'92. LNCS 663, 1992.

No context found.

Bensalem S., Bouajani A., Loiseaux C. and Sifakis J. [1992], Property preserving simulations, in G. V. Bochmann and D. K. Probst, eds, `Proc. 4th Int. Conf. on Computer Aided Veri cation (CAV '92)'.

No context found.

BENSALEM, S., BOUAJJANI, A., LOISEAUX, C., AND SIFAKIS, J. 1992. Property preserving simulations. In Computer-Aided Verification (CAV).

No context found.

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In G. V. Bochmann and D. K. Probst, editors, Proceedings of the Fourth Workshop on Computer-Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 260--273. Springer-Verlag, July 1992.

No context found.

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulation. In Computer-aided Verification, volume 663 LNCS, pages 260--273, 1991.

No context found.

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In CAV'98. LNCS 663, 1992.

No context found.

S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proc. 4th Workshop on Computer AidedVerification, Montreal, June 1992.

First 50 documents  Next 50

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