A UTP semantics for communicating processes with shared variables

No Thumbnail Available
File version
Author(s)
Shi, L
Zhao, Y
Liu, Y
Sun, J
Dong, JS
Qin, S
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2013
Size
File type(s)
Location
License
Abstract

CSP# (Communicating Sequential Programs) is a modelling language designed for specifying concurrent systems by integrating CSP-like compositional operators with sequential programs updating shared variables. In this paper, we define an observation-oriented denotational semantics in an open environment for the CSP# language based on the UTP framework. To deal with shared variables, we lift traditional event-based traces into hybrid traces which consist of event-state pairs for recording process behaviours. We also define refinement to check process equivalence and present a set of algebraic laws which are established based on our denotational semantics. Our approach thus provides a rigorous means for reasoning about the correctness of CSP# process behaviours. We further derive a closed semantics by focusing on special types of hybrid traces; this closed semantics can be linked with existing CSP# operational semantics.

Journal Title

Lecture Notes in Computer Science

Conference Title
Book Title
Edition
Volume

8144 LNCS

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Software engineering not elsewhere classified

Persistent link to this record
Citation
Collections