Using Linear Logic to Verify Requirement Scenarios in SOA Models based on Interorganizational WorkFlow Nets Relaxed Sound

Kênia Santos de Oliveira, Vinícius Ferreira de Oliveira, Stéphane Julia

Abstract

This paper presents a method for requirement verification in Service-Oriented Architecture (SOA) models based on Interorganizational WorkFlow nets which are not necessarily deadlock-freeness. In this method, a requirement model corresponds to a public model that only specify tasks which are of interest of all parties involved. An architectural model is considered as a set of private processes that interact through asynchronous communication mechanisms in order to produce the services specified in the corresponding requirement model. Services can be seen as scenarios of WorkFlow nets. For each scenario that exists in the requirement model a proof tree of Linear Logic can be produced, and for each scenario correctly finalized, a precedence graph that specifies the task sequence can be derived. For each scenario of the architectural model, similar precedence graphs can be produced. The precedence graphs of the requirement and architectural model are then compared in order to verify if all existing scenarios of the requirement model also exist at the architectural model level. The comparison of behavior between distinct discrete events models is based on the notion of branching bisimilarity that prove behavioral equivalence between distinct finite automata. The example used to illustrate the proposed approach, shows that the method can be effective to identify if a SOA-based system satisfy the business needs specified by a model of public requirements.

References

  1. Basten, T. (1998). In Terms of Nets System Design With Petri Nets and Process Algebra. PhD thesis, Eindhoven University of Technology, Eindhoven, Netherlands.
  2. Diaz, M. (2009). Petri Nets: Fundamental Models, Verification and Applications. Wiley-ISTE, Reading, Massachusetts.
  3. Fahland, D., Favre, C., Koehler, J., Lohmann, N., Volzer, H., and Wolf, K. (2011). Analysis on demand: Instantaneous soundness checking of industrial business process models. Data Knowledg Engineering, pages 448-466.
  4. Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science, pages 1-102.
  5. Girault, F., Pradin-Chezalviel, B., and Valette, R. (1997). A logic for petri nets. Journal européen des systèmes automatisés.
  6. Goknil, A., Kurtev, I., and Berg, K. V. D. (2014). Generation and validation of traces between requirements and architecture based on formal trace semantics. Journal of Systems and Software, pages 112 - 137.
  7. Park, D. (1981). Concurrency and automata on infinite sequences. In 5th GI-Conference on Theoretical Computer Science, pages 167-183. Springer Verlag, Berlin, Germany.
  8. Passos, L. M. S. (2016). A Metodology based on Linear Logic for Interorganizational Workflow Processes Analysis. PhD thesis, Federal Univerty of Uberlandia.
  9. Passos, L. M. S. and Julia, S. (2013). Qualitative analysis of interorganizational workflow nets using linear logic: Soundness verification. In IEEE 25th International Conference on Tools with Artificial Intelligence, pages 667-673.
  10. Passos, L. M. S. and Julia, S. (2014). Linear logic as a tool for deadlock-freeness scenarios detection in interorganizational workflow processes. In IEEE 26th International Conference on Tools with Artificial Intelligence, pages 316-320.
  11. Riviere, N., Pradin-Chezalviel, B., and Valette, R. (2001). Reachability and temporal conflicts in t-time petri nets. In 9th international Workshop on Petri Nets and Performance Models.
  12. Valette, R. (1979). Analysis of petri nets by stepwise refinements. Journal of Computer and System Sciences, pages 35-46.
  13. van der Aalst, W. M. P. (1996). Structural characterizations of sound workflow nets. Computing science reports/23, Eindhoven University of Technology.
  14. van der Aalst, W. M. P. (1998). Modeling and analyzing interorganizational workflows. In International Conference on Application of Concurrency to System Design, pages 262-272. IEEE Computer Society Press.
  15. van der Aalst, W. M. P. (2000). Loosely coupled interorganizational workflows: modeling and analyzing workflows crossing organizational boundaries. Information and Management, pages 67-75.
  16. van der Aalst, W. M. P. (2003). Inheritance of interorganizational workflows: How to agree to disagree without loosing control? Information Technology and Management, pages 345-389.
  17. van Glabbeek, R. J. and Weijland, W. P. (1996). Branching time and abstraction in bisimulation semantics. Journal of the ACM, pages 555-600.
  18. Zernadji, T., Tibermacine, C., Cherif, F., and Zouioueche, A. (2015). Integrating quality requirements in engineering web service orchestrations. Journal of Systems and Software, pages 463 - 483.
Download


Paper Citation


in Harvard Style

Oliveira K., Ferreira de Oliveira V. and Julia S. (2017). Using Linear Logic to Verify Requirement Scenarios in SOA Models based on Interorganizational WorkFlow Nets Relaxed Sound . In Proceedings of the 19th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-758-248-6, pages 254-262. DOI: 10.5220/0006290202540262


in Bibtex Style

@conference{iceis17,
author={Kênia Santos de Oliveira and Vinícius Ferreira de Oliveira and Stéphane Julia},
title={Using Linear Logic to Verify Requirement Scenarios in SOA Models based on Interorganizational WorkFlow Nets Relaxed Sound},
booktitle={Proceedings of the 19th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2017},
pages={254-262},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006290202540262},
isbn={978-989-758-248-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 19th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - Using Linear Logic to Verify Requirement Scenarios in SOA Models based on Interorganizational WorkFlow Nets Relaxed Sound
SN - 978-989-758-248-6
AU - Oliveira K.
AU - Ferreira de Oliveira V.
AU - Julia S.
PY - 2017
SP - 254
EP - 262
DO - 10.5220/0006290202540262