Using a Process Algebra to control B OPERATIONS

Treharne, Helen; Schneider, Steve

doi:10.1007/978-1-4471-0851-1_23

Cited by 42 publications

(29 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work could also be extended to other combinations of Object-Z and CSP, such as those described in [13,23], and also to integrations involving other state-based languages such as B [35].…”

Section: Discussionmentioning

confidence: 99%

Structural Refinement of Systems Specified in Object-Z and CSP

Derrick

Smith

2003

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. This paper is concerned with methods for refinement of specifications written using a combination of Object-Z and CSP. Such a combination has proved to be a suitable vehicle for specifying complex systems which involve state and behaviour, and several proposals exist for integrating these two languages. The basis of the integration in this paper is a semantics of Object-Z classes identical to CSP processes. This allows classes specified in Object-Z to be combined using CSP operators.It has been shown that this semantic model allows state-based refinement relations to be used on the Object-Z components in an integrated Object-Z / CSP specification. However, the current refinement methodology does not allow the structure of a specification to be changed in a refinement, whereas a full methodology would, for example, allow concurrency to be introduced during the development life-cycle. In this paper, we tackle these concerns and discuss refinements of specifications written using Object-Z and CSP where we change the structure of the specification when performing the refinement. In particular, we develop a set of structural simulation rules which allow single components to be refined to more complex specifications involving CSP operators. The soundness of these rules is verified against the common semantic model and they are illustrated via a number of examples.

show abstract

Section: Discussionmentioning

confidence: 99%

Structural Refinement of Systems Specified in Object-Z and CSP

Derrick

Smith

2003

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…Ensuring the divergence-freedom of CSP B components Originally, the technique for ensuring the divergence-freedom of a controlled machine (P M P ) involved the stating of a Control Loop Invariant (CLI) and its verification [15,16]. Fortunately, the above technique has evolved into a more general and less cumbersome one.…”

Section: Fig 4 Csp B Componentsmentioning

confidence: 99%

Relaxing B Sharing Restrictions within CSP||B

Lanoix

Kouchnarenko

Colin³

et al. 2012

Software Composition

View full text Add to dashboard Cite

Abstract. This paper addresses the issue of state sharing in CSP B specifications: B machines controlled by various CSP parts are supposed not to refer to, share or modify the same state space. However, some kinds of B state sharing can be allowed without creating inconsistencies in CSP B specifications. To achieve this, we present an approach where inconsistencies in state sharing can be identified by translating the CSP controllers to B specifications and then using a more refined consistency checking process.

show abstract

“…Laws are explored in [CSW03] and tools are under development [WCF05,FC06]. Several combinations of a process algebra with a state-based formalism have been proposed [Fis98,TS99,MD00]; the distinguishing features of Circus are its refinement theory and technique.…”

Section: Introductionmentioning

confidence: 99%

A process algebraic framework for specification and validation of real-time systems

Sherif

Cavalcanti

et al. 2010

Form. Asp. Comput.

View full text Add to dashboard Cite

Following the trend to combine techniques to cover several facets of the development of modern systems, an integration of Z and CSP, called Circus , has been proposed as a refinement language; its relational model, based on the unifying theories of programming (UTP), justifies refinement in the context of both Z and CSP. In this paper, we introduce Circus Time , a timed extension of Circus , and present a new UTP time theory, which we use to give semantics to Circus Time and to validate some of its laws. In addition, we provide a framework for validation of timed programs based on FDR, the CSP model-checker. In this technique, a syntactic transformation strategy is used to split a timed program into two parallel components: an untimed program that uses timer events, and a collection of timers. We show that, with the timer events, it is possible to reason about time properties in the untimed language, and so, using FDR. Soundness is established using a Galois connection between the untimed UTP theory of Circus (and CSP) and our time theory.

show abstract

Using a Process Algebra to control B OPERATIONS

Cited by 42 publications

References 4 publications

Structural Refinement of Systems Specified in Object-Z and CSP

Structural Refinement of Systems Specified in Object-Z and CSP

Relaxing B Sharing Restrictions within CSP||B

A process algebraic framework for specification and validation of real-time systems

Contact Info

Product

Resources

About