Realizability of BPMN 2.0 Choreography using CSP

Service-oriented computing is a new computing paradigm that uses services to support the rapid development of distributed software systems. The paradigm of software development is built software systems by reusing and combining existing concurrent and distributed services. In order to accomplish a t...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE International Conference on Computer Science and Educational Informatization (CSEI) pp. 118 - 123
Main Authors RuiQiong, Wu, Qing, Duan, Fei, Dai
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2019
Subjects
Analytical models
Asynchronous communication
BPMN2.0
Choreography
CSP
Encoding
Logic gates
Realizability
Service
Task analysis
Online AccessGet full text

Cover

More Information
Summary:Service-oriented computing is a new computing paradigm that uses services to support the rapid development of distributed software systems. The paradigm of software development is built software systems by reusing and combining existing concurrent and distributed services. In order to accomplish a task together, these services must coordinate their execution through interacting with each other. Interactions among a set of services involved in a new system are described from a global point of view using choreography specification languages. The realizability indicates whether peers can be generated from a choreography so that they will behave exactly as formalized in its specification. This paper uses CSP# to analysis the realizability of BPMN2.0 choreography. The main research contents are as follows: 1) Encoding BMPN2.0 choreography in CSP#. 2) The mapping of CSP # choreography to peers. 3) The realizability under synchronous communication and bounded asynchronous communication with CSP#.
DOI:10.1109/CSEI47661.2019.8938984