Output details
11 - Computer Science and Informatics
University of Westminster
Return to search
Output 0 of 0 in the submission
Article title
A CSP model with flexible parallel termination semantics
Type
D - Journal article
Title of journal
Formal Aspects of Computing
Article number
-
Volume number
21
Issue number
5
First page of article
421
ISSN of journal
0934-5043
Year of publication
2009
Number of additional authors
1
Additional information
<10>Originality: The paper presents a new variant of the process algebra Communicating Sequential Processes (CSP), called CSPt . CSPt is an original solution to a known problem with modelling process termination within CSP.
Significance: CSP is the most widely used process algebra used to model concurrent systems. CSPt provides system developers with a more expressive and natural formal language in which to design systems, than existing models.
Rigour: The new CSPt language and model is proved mathematically sound. Results published in a leading, peer-reviewed journal.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-