USING DISTRIBUTED CSPs TO MODEL BUSINESS PROCESSES AGREEMENT IN SOFTWARE MULTIPROCESS

Luisa Parody, María Teresa Gómez-López, Rafael M. Gasca, Diana Borrego

Abstract

A business process consists of a set of activities which are performed in a coordination way to obtain an objective. Sometimes the definition of this objective using only a classic business processes management is not possible. When the choreography of the processes cannot be defined with a combination of tasks using sequences, conditions, ’xor’, ’or’ and ’split’ control flow patterns, another representation and solution are necessary to be used. This problem makes difficult the decision making in software management projects. In this paper a way to describe a process agreement is described where the execution and the number of tasks execution order of the Web Services cannot be defined. As a case study, the resource distribution in a multiproject development environment is used. In this case, the processes have to achieve an agreement in function of the business rules that relate the processes. In order to achieve this objective, the Distributed Constraint Satisfaction Problems are used to model and solve this type of problems.

References

  1. Abril L ópez, M., Barber Sanchs, F., and Salido Gregorio, M. A. (2007). Particionamiento y Resolución Distribuida Multivariable de Problemas de Satisfacción de Restricciones. PhD thesis, Universidad Politcnica de Valencia, Valencia.
  2. Ezzahir, R., Bessiere, C., Benelallam, I., Bouyakhf, H., and Belaïssaoui, M. (2008). Dynamic backtracking for distributed constraint optimization. In ECAI, pages 901-902.
  3. Navascués Fernández-Victorio, J. and Ramos Román, I. (2008). Un modelo para la simulación híbrida de la producción de software a medida en un entorno multiproyecto. PhD thesis, Universidad de Sevilla.
  4. Wolter, C. and Schaad, A. (2007). Modeling of task-based authorization constraints in bpmn. In BPM, pages 64- 79.
  5. Wu, Y. and Doshi, P. (2008). Making bpel flexible - adapting in the context of coordination constraints using ws-bpel. pages 423-430.
  6. Yokoo, M. and Hirayama, K. (2000). Algorithms for distributed constraint satisfaction: A review. In AAAI, volume 3, pages 198-212.
Download


Paper Citation


in Harvard Style

Parody L., Teresa Gómez-López M., M. Gasca R. and Borrego D. (2011). USING DISTRIBUTED CSPs TO MODEL BUSINESS PROCESSES AGREEMENT IN SOFTWARE MULTIPROCESS . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8425-41-6, pages 434-438. DOI: 10.5220/0003180904340438


in Bibtex Style

@conference{icaart11,
author={Luisa Parody and María Teresa Gómez-López and Rafael M. Gasca and Diana Borrego},
title={USING DISTRIBUTED CSPs TO MODEL BUSINESS PROCESSES AGREEMENT IN SOFTWARE MULTIPROCESS},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2011},
pages={434-438},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003180904340438},
isbn={978-989-8425-41-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - USING DISTRIBUTED CSPs TO MODEL BUSINESS PROCESSES AGREEMENT IN SOFTWARE MULTIPROCESS
SN - 978-989-8425-41-6
AU - Parody L.
AU - Teresa Gómez-López M.
AU - M. Gasca R.
AU - Borrego D.
PY - 2011
SP - 434
EP - 438
DO - 10.5220/0003180904340438