Skip to main content
SpringerLink
Log in

Efficient Controllability Analysis of Open Nets

  • Conference paper
Web Services and Formal Methods (WS-FM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5387))

Included in the following conference series:

Abstract

A service is designed to interact with other services. If the service interaction is stateful and asynchronous, the interaction protocol can become quite complex. A service may be able to interact with a lot of possible partner services, one partner or no partner at all. Having no partner surely is not intended by the designer. But the stateful interaction between services can be formalized and thus analyzed at design time.

We present a formalization which is centered around a graph data structure that we call interaction graph, which represents feasible runs of a partner service according to the interaction protocol. As interaction graphs suffer from state explosion, we introduce a set of suitable reduction rules to alleviate the complexity of our approach. As our case studies show we are able to analyze the interaction behavior of a service efficiently.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Papazoglou, M.: Web Services: Principles and Technology. Pearson - Prentice Hall, Essex (2007)

    Google Scholar 

  2. Alves, A., et al.: Web Services Business Process Execution Language Version 2.0. Technical report, OASIS (2007)

    Google Scholar 

  3. Martens, A.: Analyzing Web Service Based Business Processes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 19–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Massuthe, P., Reisig, W., Schmidt, K.: An Operating Guideline Approach to the SOA. AMCT 1(3), 35–43 (2005)

    Google Scholar 

  5. Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing interacting WS-BPEL processes using flexible model generation. DKE 64(1), 38–54 (2008)

    Article  Google Scholar 

  6. Badouel, E., Darondeau, P.: Theory of Regions. In: Lectures on Petri Nets I: Basic Models. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing Interacting BPEL Processes. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 17–32. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Reisig, W.: Petri Nets. EATCS monographs on theoretical computer science edn. Springer, Heidelberg (1985)

    Book  MATH  Google Scholar 

  9. Lohmann, N., Massuthe, P., Wolf, K.: Operating Guidelines for Finite-State Services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Aalst, W.: The Application of Petri Nets to Workflow Management. Journal of Circuits, Systems and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  11. Weinberg, D.: Reduction Rules for Interaction Graphs. Technical Report 198, Humboldt-Universität zu Berlin (2006)

    Google Scholar 

  12. Schmidt, K.: Controllability of Open Workflow Nets. In: EMISA. LNI, pp. 236–249. Bonner Köllen Verlag (2005)

    Google Scholar 

  13. Massuthe, P., Serebrenik, A., Sidorova, N., Wolf, K.: Can I find a partner? Inf. Process. Lett. (2008) (accepted)

    Google Scholar 

  14. Schmidt, K.: Stubborn sets for standard properties. In: ICATPN 1999. LNCS, vol. 1639, pp. 46–65. Springer, Heidelberg (1999)

    Google Scholar 

  15. Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design 1(4), 297–322 (1992)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt–Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Daniela Weinberg

Authors
  1. Daniela Weinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Roberto Bruni

  2. Institut für Informatik, Universität Rostock, Albert- Einstein-Str. 21, 18059, Rostock, Germany

    Karsten Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weinberg, D. (2009). Efficient Controllability Analysis of Open Nets. In: Bruni, R., Wolf, K. (eds) Web Services and Formal Methods. WS-FM 2008. Lecture Notes in Computer Science, vol 5387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01364-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01364-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01363-8

  • Online ISBN: 978-3-642-01364-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation