Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes

Redouane Bouchekir, Saida Boukhedouma, Mohand Cherif Boukala

Abstract

For many complex systems, it is important to verify formally their correctness; the aim is to guarantee the reliability and the correctness of such systems before their effective deployment. Several methods have been proposed to this effect using different formal tools such as Probabilistic Automata (PA). In this paper we focus on verification of service-based inter-organizational workflow (IOWF) processes which support collaboration and cooperation between WF processes attached to several partners, and specified using the business process execution language (BPEL4WS). Then, IOWF processes are translated to Probabilistic Automata (PA) models. More than verification support, PA provides a numerical evaluation of the IOWF process. We also propose the use of compositional verification to cope with the state space explosion problem. The IOWF behavior is checked against probabilistic safety properties. The verification and the analysis are performed in an automated way using the PRISM model checker and based on the assume-guarantee reasoning rule.

References

  1. Alonso, G., Casati, F., Kuno, H., and Machiraju, V. (2004). Web services : concepts, architectures and applications. Springer.
  2. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and computation, 75(2):87-106.
  3. Baier, C., Katoen, J.-P., et al. (2008). Principles of model checking, volume 26202649. MIT press Cambridge.
  4. Baier, C. and Kwiatkowska, M. (1998). Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155.
  5. Bentahar, J., Yahyaoui, H., Kova, M., and Maamar, Z. (2013). Symbolic model checking composite web services using operational and control behaviors. Expert Systems with Applications, 40(2):508-522.
  6. Braghetto, K. R., Ferreira, J. E., and Vincent, J.-M. (2011). Performance evaluation of business processes through a formal transformation to san. In Computer Performance Engineering, pages 42-56. Springer.
  7. Calinescu, R., Kikuchi, S., and Johnson, K. (2012). Compositional reverification of probabilistic safety properties for large-scale complex it systems. In LargeScale Complex IT Systems. Development, Operation and Management, pages 303-329. Springer.
  8. Chen, Y.-F., Clarke, E. M., Farzan, A., Tsai, M.-H., Tsay, Y.-K., and Wang, B.-Y. (2010). Automated assume-guarantee reasoning through implicit learning. In Computer Aided Verification, pages 511-526. Springer.
  9. Doshi, P., Goodwin, R., Akkiraju, R., and Verma, K. (2004). Dynamic workflow composition using markov decision processes. In Web Services, 2004. Proceedings. IEEE International Conference on, pages 576-582. IEEE.
  10. Etessami, K., Kwiatkowska, M., Vardi, M. Y., and Yannakakis, M. (2007). Multi-objective model checking of markov decision processes. In Tools and Algorithms for the Construction and Analysis of Systems, pages 50-65. Springer.
  11. Feng, L. (2013). On Learning Assumptions for Compositional Verification of Probabilistic Systems. PhD thesis, University of Oxford.
  12. Feng, L., Kwiatkowska, M., and Parker, D. (2010). Compositional verification of probabilistic systems using learning. In Quantitative Evaluation of Systems (QEST), 2010 Seventh International Conference on the, pages 133-142. IEEE.
  13. Gabrel, V., Manouvrier, M., and Murat, C. (2013). A new linear program for qos-aware web service composition based on complex workflow.
  14. Gallotti, S., Ghezzi, C., Mirandola, R., and Tamburrelli, G. (2008). Quality prediction of service compositions through probabilistic model checking. In Quality of Software Architectures. Models and Architectures, pages 119-134. Springer.
  15. Gorton, S., Montangero, C., Reiff-Marganiec, S., and Semini, L. (2009). Stpowla: Soa, policies and workflows. In Service-Oriented Computing-ICSOC 2007 Workshops, pages 351-362. Springer.
  16. Hansson, H. and Jonsson, B. (1994). A logic for reasoning about time and reliability. Formal aspects of computing, 6(5):512-535.
  17. Hart, S. et al. (1984). Probabilistic temporal logics for finite and bounded models. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 1-13. ACM.
  18. He, F., Gao, X., Wang, B.-Y., and Zhang, L. (2015). Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems. In Proceedings of the 42nd Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 503-514. ACM.
  19. Jordan, D., Evdemon, J., Alves, A., Arkin, A., Askary, S., Barreto, C., Bloch, B., Curbera, F., Ford, M., Goland, Y., et al. (2007). Web services business process execution language version 2.0. OASIS standard, 11(120):5.
  20. Komuravelli, A., Pasareanu, C. S., and Clarke, E. M. (2012). Learning probabilistic systems from tree samples. In Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, pages 441-450. IEEE Computer Society.
  21. Kwiatkowska, M., Norman, G., and Parker, D. (2009). Prism: Probabilistic model checking for performance and reliability analysis. ACM SIGMETRICS Performance Evaluation Review, 36(4):40-45.
  22. Larsen, K. G., Pettersson, P., and Yi, W. (1995). Compositional and symbolic model-checking of real-time systems. In Real-Time Systems Symposium, 1995. Proceedings., 16th IEEE, pages 76-87. IEEE.
  23. Lehmann, D. and Shelah, S. (1982). Reasoning with time and chance. Information and Control, 53(3):165-198.
  24. Pa?sa?reanu, C. S., Giannakopoulou, D., Bobaru, M. G., Cobleigh, J. M., and Barringer, H. (2008). Learning to divide and conquer: applying the l* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design, 32(3):175-205.
  25. Sbaï, Z., Missaoui, A., Barkaoui, K., and Ben Ayed, R. (2010). On the verification of business processes by model checking techniques. In Software Technology and Engineering (ICSTE), 2010 2nd International Conference on, volume 1, pages V1-97. IEEE.
  26. Segala, R. (1995). Modelling and verification of randomized distributed real time systems. PhD thesis, Massachusetts Institute of Technology.
  27. Sheng, Q. Z., Qiao, X., Vasilakos, A. V., Szabo, C., Bourne, S., and Xu, X. (2014). Web services composition: A decade's overview. Information Sciences, 280:218- 238.
  28. Van Der Aalst, W. M. (1999). Process-oriented architectures for electronic commerce and interorganizational workflow. Information systems, 24(8):639-671.
Download


Paper Citation


in Harvard Style

Bouchekir R., Boukhedouma S. and Boukala M. (2016). Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes . In Proceedings of the 6th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, ISBN 978-989-758-199-1, pages 244-253. DOI: 10.5220/0005978602440253


in Bibtex Style

@conference{simultech16,
author={Redouane Bouchekir and Saida Boukhedouma and Mohand Cherif Boukala},
title={Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes},
booktitle={Proceedings of the 6th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,},
year={2016},
pages={244-253},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005978602440253},
isbn={978-989-758-199-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,
TI - Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes
SN - 978-989-758-199-1
AU - Bouchekir R.
AU - Boukhedouma S.
AU - Boukala M.
PY - 2016
SP - 244
EP - 253
DO - 10.5220/0005978602440253