Show simple item record

dc.contributor.authorShi, L
dc.contributor.authorZhao, Y
dc.contributor.authorLiu, Y
dc.contributor.authorSun, J
dc.contributor.authorDong, JS
dc.contributor.authorQin, S
dc.description.abstractCSP# (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.
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume8144 LNCS
dc.subject.fieldofresearchSoftware engineering not elsewhere classified
dc.titleA UTP semantics for communicating processes with shared variables
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorDong, Jin-Song

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record