S. Graf, B. Ste#en and G. Luttgen, Compositional Minimisation of Finite State Systems Using Interface Specifications, in Formal Aspects of Computing 8:5(607--616), 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....separately may lead to state explosion, whereas the generation of the whole system of concurrent processes might succeed if processes constrain each other when composed in parallel. This issue has been addressed by re ned compositional veri cation approaches [GS90, CK93, Yeh93, CK95, CK96, GSL96, KM97, Che98, Gia99] which allow to generate the Lts of each separate process by taking into account interface constraints (also known as environment constraints or context constraints) These constraints express the behavioral restrictions imposed on each process by synchronization with its ....

S. Graf, B. Steen, and G. Luttgen. Compositional Minimisation of Finite State Systems using Interface Specications. Formal Aspects of Computation, 8, September 1996.

.... three key techniques: i) compositional minimization techniques build the state space of a concurrent system stepwise, i.e. parallel component by parallel component, and minimize the state space of each intermediate system according to a behavioral congruence or an interface specification [13]; ii) Partial order techniques exploit the fact that several traces of an asynchronous system may be equivalent with respect to the properties of interest [12, 22, 24] thus, it is sufficient to explore only a single trace of each equivalence class; iii) techniques exploiting symmetries in ....

S. Graf, B. Steffen, and G. Luttgen. Compositional minimisation of finite state systems using interface specifications. FAC, 8(5):607--616, 1996.

....a system is linear in the number of the system s states, which in practice limits these techniques to fairly small systems having at most a few million states. However, since state spaces are encoded explicitly in their natural form, minimization techniques with respect to behavioral equivalences [12] or partial order techniques [11] may be applied to reduce the sizes of state spaces further. Explicit techniques prove especially advantageous if one is interested in the numerical analysis of Markov processes defined over such state spaces [16] This work was supported by the National ....

....three key techniques. i) Compositional minimization techniques build the state space of a concurrent system stepwise, i.e. parallel component by parallel component, and minimize the state space of each intermediate system according to a behavioral congruence or an interface specification [12]. ii) Partial order techniques exploit the fact that several traces of an asynchronous system may be equivalent with respect to the properties of interest [11] thus, it is sufficient to explore only a single trace of each equivalence class. iii) Techniques exploiting symmetries in systems ....

S. Graf, B. Steffen, and G. L uttgen, Compositional minimisation of finite state systems using interface specifications, Formal Aspects of Computing, 8 (1996), pp. 607--616.

....of the complete system often only a subset of all possible acknowledgement messages can actually occur. In the abstraction it is specified that after the reception of an unexpected acknowledgement message, the abstraction becomes chaotic , capable of performing any action (same idea appears in [5]) The abstraction was formulated manually, aided by intuitions on which characteristics of the protocol were relevant for liveness properties. Once the abstraction was constructed, claims A C were checked by the ARA toolset [15] SENDER ABSTRACTION Variables d[ Gammatw) tw Gamma 1) ....

Graf, S. & Steffen, B. & Luttgen, G.: Compositional Minimisation of Finite State Systems Using Interface Spec., in Formal Asp. of Comp., vol. 8, 1996, pp. 607-616

....unnecessary execution sequences, forbidden by the synchronizations expected by the rest of the composition expression (its environment) In the worst cases, the size of S 0 may even exceed the one of S, leading to a failure of this approach. A solution to this problem has been proposed in [GS90,GLS96] and [CK93,CK95] for composition expressions based on the Csp [Hoa78] parallel operator. Intuitively, it consists in expressing the environment of a subexpression by an interface, i.e. an Lts representing a set of authorized execution sequences that can be performed by this sub expression. ....

....paper a generalization of the results presented in [GS90] and [CK93] for applying a compositional generation method to Lotos programs. Although many other works have been already carried out on compositional verification and compositional generation (an interesting classification can be found in [GLS96] only a few of them to our knowledge have been applied to large examples in order to make a fair comparison with other advanced verification techniques. The integration within the Cadp toolbox of the compositional generation method described in this paper, and its evaluation on ....

S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996. appeared as Passauer Informatik Bericht MIP9505.

....per level) for the former model and N levels (one subnet per level) for the latter. Events are either local or synchronize adjacent subnets, thus they span only two levels, except for those synchronizing subnet N with subnet 1, which span the entire MDD. The round robin mutex protocol model [17] also has N identical safe subnets placed in a circular fashion, which represent N processes, each mapped to one MDD level. Another subnet models a resource shared by the N processes, giving raise to one more level, at the bottom of the MDD. There are no local events and, in addition to events ....

S. Graf, B. Steffen, and G. Luttgen. Compositional minimisation of finite state systems using interface specifications. Formal Asp. of Comp., 8(5):607--616, 1996.

....and then compose the quotients M i =R. The hope is that the generated intermediate models can be kept small. This compositional generation method has already been applied for specification formalisms based on rendez vous communication between processes, and has been shown efficient in practice [GLS96,Val96,KM97] To our knowledge it has not been investigated for systems based on communication via buffers, may be, because buffers raise several difficulties or due to the lack of suitable representations and tools. The potential benefit of this compositional approach will be illustrated on an ....

S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996.

....M i =R. Thus, the initial program is never considered as a whole and the generated models can be kept small. This compositional generation method has already been applied for specification formalisms based on rendez vous communication between processes, and has been shown efficient in practice [GLS96, Val96, KM97] Surprisingly, to our knowledge it has not been investigated within an sdl framework, may be, because buffers raise several difficulties or due to lack of suitable tools. To illustrate the benefit of a compositional approach we briefly describe here its application to the token ....

S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996.

....compo is a tool being developed at Verimag for compositional generation of minimal models associated with if programs. This compositional generation method has already been applied for specification formalisms based on rendez vous communication, and has been shown efficient in practice [GLS96,Val96,KM97] It has not been investigated for systems based on communication via buffers, may be, because buffers raise several difficulties or due to the lack of suitable representations and tools. The potential benefit of this approach is illustrated on an example in the next section. 5 An ....

S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996.

....is never considered as a whole and the hope is that the generated intermediate models can be kept small. This compositional generation method has already been applied for specification formalisms based on rendez vous communication between processes, and has been shown efficient in practice [32 34]. To our knowledge it has not been investigated within an sdl framework, may be, because buffers raise several difficulties or due to lack of suitable tools. To illustrate the benefit of a compositional approach we briefly describe here its application to the token ring protocol: 1. We split the ....

S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996.

No context found.

S. Graf, B. Ste#en and G. Luttgen, Compositional Minimisation of Finite State Systems Using Interface Specifications, in Formal Aspects of Computing 8:5(607--616), 1996.

No context found.

S. Graf, B. Steffen, and G. L uttgen. Compositional minimisation of finite state systems using interface specifications. Formal Aspects of Computation, 8, 1996.

No context found.

Susanne Graf, Bernhard Steffen, and Gerlad Luttgen. Compositional minimisation of finite state systems using interface specifications. Formal Aspects of Computing, 8(5):607--616, 1996.

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