Paper Info
Title
Checking Realizability Of A Timed Business Processes Choreography
Abstract
A business process (BP) can be understood as a set of related, structured, interacting services acting as peers, according to an intended choreography that is capable of giving complex functionality to customers. Several authors have made progress in solving the "choreography realization" problem. The research work carried out in this paper amounts to analyzing and automatically checking the realizability of the defined choreography for services that communicate through messages in a general, distributed, and highly parallel system.
Year
DOI
Venue
2017
10.5220/0006300404410448
CLOSER: PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND SERVICES SCIENCE
Keywords
Field
DocType
Business Process Management, Business Process as a Service, BPMN, Process Modeling, Temporal Constraints and Dependencies, Temporal Semantics
Business process,Computer science,Choreography,Realizability,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Manuel I. Capel15217.35