Skip to main content

On Limitations of Abstraction-Based Deadlock-Analysis of Service-Oriented Systems

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

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

Included in the following conference series:

Abstract

Deadlock-analysis of concurrent service-oriented systems is often done by P/T-net-based approaches. We show that there is a concurrent service-oriented system with synchronous (stack behavior) and asynchronous procedure (concurrent behavior) calls with a deadlock that is not discovered by classical P/T-net-based approaches. Hence, P/T-net-based approaches lead to false statements on absence of deadlocks. We propose an approach based on Mayr’s Process Rewrite Systems to model both, concurrent and stack behavior while the deadlock problem remains decidable.

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

Access this chapter

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

References

  1. Both, A., Zimmermann, W.: Automatic protocol conformance checking of recursive and parallel component-based systems. In: Chaudron, M.R.V., Szyperski, C., Reussner, R. (eds.) CBSE 2008. LNCS, vol. 5282, pp. 163–179. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87891-9_11

    Chapter  Google Scholar 

  2. Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: ACM SIGPLAN Notices, vol. 47, pp. 203–214. ACM (2012)

    Google Scholar 

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

    Article  Google Scholar 

  4. Haddad, S., Poitrenaud, D.: Modelling and analyzing systems with recursive Petri Nets. In: Boel, R., Stremersch, G. (eds.) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol. 569. Springer, Boston (2000). https://doi.org/10.1007/978-1-4615-4493-7_48

    Chapter  MATH  Google Scholar 

  5. Heike, C., Zimmermann, W., Both, A.: On expanding protocol conformance checking to exception handling. SOCA 8(4), 299–322 (2014). https://doi.org/10.1007/s11761-013-0146-2

    Article  Google Scholar 

  6. 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 

  7. Martens, A.: Analyzing web service based business processes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 19–33. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31984-9_3

    Chapter  Google Scholar 

  8. Mayr, R.: Process rewrite systems. Inf. Comput. 156(1–2), 264–286 (2000)

    Article  MathSciNet  Google Scholar 

  9. 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 

  10. 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 

  11. 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  MATH  Google Scholar 

  12. Weißbach, M., Zimmermann, W.: on abstraction-based deadlock-analysis in service-oriented systems with recursion. In: De Paoli, F., Schulte, S., Broch Johnsen, E. (eds.) ESOCC 2017. LNCS, vol. 10465, pp. 168–176. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67262-5_13

    Chapter  Google Scholar 

  13. Zimmermann, W., Schaarschmidt, M.: Automatic checking of component protocols in component-based systems. In: Löwe, W., Südholt, M. (eds.) SC 2006. LNCS, vol. 4089, pp. 1–17. Springer, Heidelberg (2006). https://doi.org/10.1007/11821946_1

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mandy Weißbach .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Weißbach, M., Zimmermann, W. (2020). On Limitations of Abstraction-Based Deadlock-Analysis of Service-Oriented Systems. In: Fazio, M., Zimmermann, W. (eds) Advances in Service-Oriented and Cloud Computing. ESOCC 2018. Communications in Computer and Information Science, vol 1115. Springer, Cham. https://doi.org/10.1007/978-3-030-63161-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63161-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63160-4

  • Online ISBN: 978-3-030-63161-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics