Skip to main content
SpringerLink
Log in

Deadlock Analysis of Service-Oriented Systems with Recursion and Concurrency

  • Conference paper
  • First Online:
Advances in Service-Oriented and Cloud Computing (ESOCC 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 707))

Included in the following conference series:

  • 827 Accesses

Abstract

In this paper, we show an abstraction-based approach towards analysis of Service-Oriented Systems with the help of Process Rewrite Systems. On the one hand the approach takes into account recursion, i.e., internal recursion in service implementations as well as external recursion over service boundaries. On the other hand, also internal concurrency and concurrency over service boundaries are considered. The abstraction can automatically derived from the service implementations.

Supervisor: Wolf Zimmermann.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63139-9_48

    Chapter  Google Scholar 

  2. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley Longman Publishing Co. Inc., Boston (2006)

    MATH  Google Scholar 

  3. Both, A., Zimmermann, W.: Automatic protocol conformance checking of recursive and parallel BPEL systems. In: IEEE Sixth European Conference on Web Services (ECOWS 2008), pp. 81–91 (2008)

    Google Scholar 

  4. Bouajjani, A., Echahed, R., Habermehl, P.: Verifying infinite state processes with sequential and parallel composition. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 95–106. ACM (1995)

    Google Scholar 

  5. Dahl, O.J., Nygaard, K.: Simula: an algol-based simulation language. Commun. ACM 9(9), 671–678 (1966)

    Article  MATH  Google Scholar 

  6. Flores-Montoya, A.E., Albert, E., Genaim, S.: May-happen-in-parallel based deadlock analysis for concurrent objects. In: Beyer, D., Boreale, M. (eds.) FMOODS/FORTE -2013. LNCS, vol. 7892, pp. 273–288. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38592-6_19

    Chapter  Google Scholar 

  7. Giachino, E., Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 63–77. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44584-6_6

    Google Scholar 

  8. Giachino, E., Laneve, C.: A beginner’s guide to the DeadLock Analysis Model. In: Palamidessi, C., Ryan, M.D. (eds.) TGC 2012. LNCS, vol. 8191, pp. 49–63. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41157-1_4

    Chapter  Google Scholar 

  9. Haddad, S., Poitrenaud, D.: Theoretical aspects of recursive petri nets. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 228–247. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48745-X_14

    Chapter  Google Scholar 

  10. Haddad, S., Poitrenaud, D.: Modelling and analyzing systems with recursive petri nets. In: Boel, R., Stremersch, G. (eds.) Discrete Event Systems, vol. 569, pp. 449–458. Springer, Boston (2000). https://doi.org/10.1007/978-1-4615-4493-7_48

    Chapter  Google Scholar 

  11. Haddad, S., Poitrenaud, D.: Recursive petri nets. Acta Informatica 44(7), 463–508 (2007). https://doi.org/10.1007/s00236-007-0055-y

    Article  MathSciNet  MATH  Google Scholar 

  12. Heike, C., Zimmermann, W., Both, A.: Protocol conformance checking of services with exceptions. In: De Paoli, F., Pimentel, E., Zavattaro, G. (eds.) ESOCC 2012. LNCS, vol. 7592, pp. 122–137. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33427-6_9

    Chapter  Google Scholar 

  13. Heike, C., Zimmermann, W., Both, A.: On expanding protocol conformance checking to exception handling. Serv. Oriented Comput. Appl. 8(4), 299–322 (2014)

    Article  Google Scholar 

  14. Hicheur, A., Ben Dhieb, A., Barkaoui, K.: Modelling and analysis of flexible healthcare processes based on algebraic and recursive petri nets. In: Weber, J., Perseil, I. (eds.) FHIES 2012. LNCS, vol. 7789, pp. 1–18. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39088-3_1

    Chapter  Google Scholar 

  15. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1), 60–65 (2001). https://doi.org/10.1145/568438.568455

    Article  MATH  Google Scholar 

  16. Kaveh, N., Emmerich, W.: Deadlock detection in distribution object systems. In: ACM SIGSOFT Software Engineering Notes, vol. 26, pp. 44–51. ACM (2001)

    Google Scholar 

  17. Mayr, R.: Combining petri nets and PA-processes. In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol. 1281, pp. 547–561. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0014567

    Chapter  Google Scholar 

  18. Mayr, R.: Decidability and complexity of model checking problems for infinite-state systems. Citeseer (1998)

    Google Scholar 

  19. Parizek, P., Plasil, F.: Modeling of component environment in presence of callbacks and autonomous activities. In: Paige, R.F., Meyer, B. (eds.) TOOLS EUROPE 2008. LNBIP, vol. 11, pp. 2–21. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69824-1_2

    Chapter  Google Scholar 

  20. Rai, G.N., Gangadharan, G., Padmanabhan, V.: Algebraic modeling and verification of web service composition. Procedia Comput. Sci. 52, 675–679 (2015)

    Article  Google Scholar 

  21. Schmidt, H.W., Krämer, B.J., Poernomo, I., Reussner, R.: Predictable component architectures using dependent finite state machines. In: Wirsing, M., Knapp, A., Balsamo, S. (eds.) RISSEF 2002. LNCS, vol. 2941, pp. 310–324. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24626-8_22

    Chapter  Google Scholar 

  22. Seghrouchni, A.E.F., Haddad, S.: A recursive model for distributed planning. In: Proceedings of the 2nd International Conference on Multi-Agent Systems (ICMAS 1996), pp. 307–314 (1996)

    Google Scholar 

  23. van der Aalst, W.M.P.: Workflow verification: finding control-flow errors using petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161–183. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45594-9_11

    Chapter  Google Scholar 

  24. Verbeek, E., van der Aalst, W.M.P.: Woflan 2.0 a petri-net-based workflow diagnosis tool. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 475–484. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44988-4_28

    Chapter  Google Scholar 

  25. Weißbach, M.: Termination analysis of concurrent service-oriented systems. Technical report, Proceedings of the Ph.D. Symposium at the 4th European Conference on Service-Oriented and Cloud Computing 1(01), pp. 23–29 (2015)

    Google Scholar 

  26. Weißbach, M., Zimmermann, W.: Checking of liveness properties in component-based systems and sercvice-oriented architectures. Technical report, Proceedings of the Ph.D. Symposium at the 8th IEEE European Conference on Web Services 1(4), pp. 09–12 (2010)

    Google Scholar 

  27. Weißbach, M., Zimmermann, W.: Termination analysis of business process workflows. In: Proceedings of the 5th International Workshop on Enhanced Web Service Technologies, WEWST 2010, pp. 18–25. ACM, New York (2010). https://doi.org/10.1145/1883133.1883137

  28. Weißbach, M., Zimmermann, W.: Termination analysis of service-oriented systems. Technical report, Proceedings of the Ph.D. Symposium at the 1st European Conference on Service-Oriented and Cloud Computing 1(3), pp. 23–38 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Martin Luther University Halle-Wittenberg, Von-Seckendorff-Platz 1, 06120, Halle, Germany

    Mandy Weißbach

Authors
  1. Mandy Weißbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mandy Weißbach .

Editor information

Editors and Affiliations

  1. University of Groningen, Groningen, The Netherlands

    Alexander Lazovik

  2. Vienna University of Technology, Vienna, Austria

    Stefan Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Weißbach, M. (2018). Deadlock Analysis of Service-Oriented Systems with Recursion and Concurrency. In: Lazovik, A., Schulte, S. (eds) Advances in Service-Oriented and Cloud Computing. ESOCC 2016. Communications in Computer and Information Science, vol 707. Springer, Cham. https://doi.org/10.1007/978-3-319-72125-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72125-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72124-8

  • Online ISBN: 978-3-319-72125-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation