Checking Realizability of a Timed Business Processes Choreography

Manuel I. Capel

2017

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.

Paper Citation

in Harvard Style

I. Capel M. (2017). Checking Realizability of a Timed Business Processes Choreography . In Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER, ISBN 978-989-758-243-1, pages 441-448. DOI: 10.5220/0006300404410448

in Bibtex Style

@conference{closer17,
author={Manuel I. Capel},
title={Checking Realizability of a Timed Business Processes Choreography},
booktitle={Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER,},
year={2017},
pages={441-448},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006300404410448},
isbn={978-989-758-243-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER,
TI - Checking Realizability of a Timed Business Processes Choreography
SN - 978-989-758-243-1
AU - I. Capel M.
PY - 2017
SP - 441
EP - 448
DO - 10.5220/0006300404410448