For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Westminster

Return to search Previous output Next output
Output 64 of 79 in the submission
Output title

Specifying and analysing networks of processes in CSPt (or in search of associativity)

Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Communicating Process Architectures 2013, 25 - 28 Aug 2013, Edinburgh Napier University, Edinburgh
Volume number
-
Issue number
-
First page of article
157
ISSN of proceedings
-
Year of publication
2013
Number of additional authors
1
Additional information

<10>Originality: This paper introduces alphabet diagrams, these identify difference categories of events that occur in networks of parallel CSP processes. Alphabet diagrams are used to identifying sufficient constraints, that are then used to prove new parallel associativity laws.

Significance: The new associativity laws are more useful than existing associativity laws, since when combined with alphabet diagrams, provide practising system designers with a methodology for constructing networks of CSP processes.

Rigour: A number of new parallel associativity laws are proved correct within the CSPt semantic model. Results published in proceedings of a specialist peer-reviewed conference.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-