Paper Info
Title
On a Process Algebraic Representation of Sequence Diagrams.
Abstract
Sequence diagrams depict the interaction between entities as a sequence of messages arranged in a temporal order. However, they lack a formal execution semantics: the Unified Modeling Language (UML) specification opts to use natural language to describe fundamental concepts such as interaction operators that alter the behaviour of a fragment. Communicating Sequential Processes (CSP) is a process-algebraic formalism that is suited to modelling patterns of behavioural interaction. Moreover, the associated refinement checker, Failures-Divergence Refinement (FDR), gives rise to a practical approach that enables us to reason about these interactions in a formal setting. In this paper, we show how CSP and FDR have been used to provide a process-algebraic representation of sequence diagrams that is amenable to refinement-checking.
Year
DOI
Venue
2014
10.1007/978-3-319-15201-1_5
Lecture Notes in Computer Science
Field
DocType
Volume
Real representation,Sequence diagram,Programming language,Unified Modeling Language,Computer science,Communicating sequential processes,Real-time computing,Natural language,Formalism (philosophy),Semantics,Interaction overview diagram
Conference
8938
ISSN
Citations 
PageRank 
0302-9743
2
0.38
References 
Authors
13
2
Name
Order
Citations
PageRank
Jaco Jacobs1122.31
Andrew Simpson228249.37