D. Bert, M.-L. Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. In H. Habrias, editor, Proceedings of the 1st Conference on the B method, pages 47--62. IRIN Institut de Recherche en Informatique de Nantes, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....other. For example in the train control system of [12] the phase controller SwOn has the invariant dstate : fclosing ; closed ; lockedg, whilst SwOff has an operation swoff dbpressed = IF motstate = stationary THEN start open doors END which breaks this invariant. Instead, the approach of [3] can be used, with a machine K which EXTENDS two machines N and M which share by INCLUDES a machine S being expressed as K = N Theta M 5.2 Aggregate and Collection Structures If a system contains several copies of a component, such as the press in the fault tolerant production cell, then a ....

D. Bert, M-L. Potet, Y. Rouzaud. A Study on Components and Assembly Primitives in B, Proceedings of 1st B Conference, pp 47--62, 1996.

....This method is adopted in the case study described in Paper I. There are different forms of refinement. In this thesis, we use algorithmic, data, and greybox, and trace refinement. The first two are described below. The others are discussed in more detail in later sections. Algorithmic refinement [3, 8] is defined to preserve correctness between statements on the same state space. An algorithmic refinement step may decrease nondeterminism and widen the termination set. 13 Data refinement [29, 22] is a technique for changing the encapsulated data structures of a module, class, or component. For ....

....abstract. 39 References [1] Jean Raymond Abrial. The B Book: Assigning Programs to Meanings. Cambridge University Press, 1996. 2] E. Astesiano, H. J. Kreowski, and B. Krieg Br uckner, editors. Algebraic Foundation of System Specification. IFIP State of the Art Reports. Springer Verlag, 1999. [3] Ralph Back. Correctness Preserving Program Refinements: Proof Theory and Applications, volume 131 of Mathematical Center Tracts. Mathematical Centre, Amsterdam, 1980. 4] Ralph Back and Reino Kurki Suonio. Decentralization of process nets with centralized control. In 2nd ACM SIGACT SIGOPS ....

[Article contains additional citation context not shown here]

Didier Bert, Marie-Laure Potet, and Yann Rouzaud. A study on components and assembly primitives in B. In Proceedings of the first B conference, pages 47--62, 3 rue du Mar echal Joffre, BP 34103, 44041 Nantes Cedex 1, 1996. IRIN Institut de recherche en informatique de Nantes.

....proof decomposition [10, 6, 7, 22] In order to achieve compositionality and independent (parallel) refinement, sharing is restricted in B. Important work in explaining and harmonizing the structuring mechanisms of B and their interplay with refinement has been done by Bert, Potet, and Rouzaud in [4] and [25, 26] In [4] they focus on the includes and uses primitives which underlie the structuring of abstract specifications and in [25] they focus on the sees and imports primitives which underlie the structuring of layered implementations. Mechanisms for supporting composition have also been ....

....6, 7, 22] In order to achieve compositionality and independent (parallel) refinement, sharing is restricted in B. Important work in explaining and harmonizing the structuring mechanisms of B and their interplay with refinement has been done by Bert, Potet, and Rouzaud in [4] and [25, 26] In [4], they focus on the includes and uses primitives which underlie the structuring of abstract specifications and in [25] they focus on the sees and imports primitives which underlie the structuring of layered implementations. Mechanisms for supporting composition have also been proposed for ....

[Article contains additional citation context not shown here]

D. Bert, M-L. Potet, and Y. Rouzaud. A study on Components and Assembly primitives in B. In H. Habrias, ed., First Conference on the B-Method, 1996.

....or the shared construct s implementation. Soundness of the mechanism is established by flattening. 1 Introduction The B method provides support for modularization and, herewith, for information hiding, compositionality of module operations, reusability of modules, and decomposition of proofs [4, 5]. Modules can be combined using a number of different mechanisms. Refinement being almost monotonic with respect to the composition mechanisms, most proof obligations arise on a per module base. The few additional restriction on the global structure can be checked automatically. In this ....

....of the imported machine, can call both inquiry and modification operations and can reference variables of the imported machine in its invariant. Imported machines can be seen by any number of other constructs. Summary The INCLUDES and USES clauses can be considered as weak or syntactic relations [5]. Their aim is to combine text of machine specifications; this structure is not reflected in subsequent refinements or in the final implementation. SEES and IMPORTS on the other hand are strong relations as the shared code will remain visible as a module in the final implementation. 2.2 A Problem ....

[Article contains additional citation context not shown here]

Didier Bert, Marie-Laure Potet, and Yann Rouzaud. A study on components and assembly primitives in B. In Proceedings of the first B conference, pages 47--62, 3 rue du Mar echal Joffre, BP 34103, 44041 Nantes Cedex 1, 1996. IRIN Institut de recherche en informatique de Nantes.

No context found.

D. Bert, M.-L. Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. In H. Habrias, editor, Proceedings of the 1st Conference on the B method, pages 47--62. IRIN Institut de Recherche en Informatique de Nantes, 1996.

No context found.

D. Bert, M.-L. Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. In H. Habrias, editor, Proceedings of the 1st Conference on the B method, pages 47--62. IRIN Institut de Recherche en Informatique de Nantes, 1996.

No context found.

D. Bert, M.-L. Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. In H. Habrias, editor, Proceedings of the 1st Conference on the B method, pages 47--62. IRIN Institut de Recherche en Informatique de Nantes, 1996.

No context found.

D. Bert, M.-L. Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. In H. Habrias, editor, Proceedings of the 1st Conference on the B method, pages 47--62. IRIN Institut de Recherche en Informatique de Nantes, 1996.

....direction (notation ) Other variables have an obvious meaning. A pair of objects of a binary relation can be written either as (x; y) or (x 7 y) The machine DOOR is extended , which means that the state and operations on door are visible inside the machine LIFT and operations are exported [1, 4]. Examples of operations to request lift from floors or to request a floor within the lift are presented in figure 3. request lift(f; d) A user requests the lift at floor f in the direction d pre f 2 FLOORS d 2 DIR (f 7 d) 6= ground 7 down) f 7 d) 6= top 7 up) then call ....

D. Bert, M.-L. Potet, and Y. Rouzaud. A study on components and assembly primitives in B. In Habrias [7], pages 47--62.

No context found.

BERT, D., POTET, M.-L., AND ROUZAUD, Y. A study on components and assembly primitives in B. In Habrias [12], pp. 47--62.

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