Skip to main content

Trace- and Failure-Based Semantics for Bounded Responsiveness

  • Conference paper

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

Abstract

We study open systems modeled as Petri nets with an interface for asynchronous communication with other open systems. As a minimal requirement for successful communication, we investigate bounded responsiveness, which guarantees that an open system and its environment always have the possibility to communicate, while the number of pending messages never exceeds a previously known bound. Bounded responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for accordance. As this relation turns out not to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in this relation, using a variation of should testing, and show decidability.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acciai, L., Boreale, M.: Responsiveness in process calculi. Theor. Comp. Sci. 409(1), 59–93 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)

    Article  Google Scholar 

  3. Bravetti, M., Zavattaro, G.: A foundational theory of contracts for multi-party service composition. Fundam. Inform. 89(4), 451–478 (2008)

    MATH  MathSciNet  Google Scholar 

  4. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560–599 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S.K., Zufferey, D.: P: safe asynchronous event-driven programming. In: PLDI 2013, pp. 321–332. ACM (2013)

    Google Scholar 

  6. Gamboni, M., Ravara, A.: Responsive choice in mobile processes. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010, LNCS, vol. 6084, pp. 135–152. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. van Glabbeek, R.J.: The coarsest precongruences respecting safety and liveness properties. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 32–52. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Kobayashi, N.: A type system for lock-free processes. Information and Computation 177(2), 122–159 (2002)

    MATH  MathSciNet  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. Lohmann, N., Verbeek, E., Dijkman, R.: Petri net transformations for business processes – A survey. In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 46–63. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Lohmann, N., Wolf, K.: Compact representations and efficient algorithms for operating guidelines. Fundam. Inform. 107, 1–19 (2011)

    MathSciNet  Google Scholar 

  12. Malik, R., Streader, D., Reeves, S.: Conflicts and fair testing. Journal of Foundations of Computer Science 17(4), 797–813 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mooij, A.J., Stahl, C., Voorhoeve, M.: Relating fair testing and accordance for service replaceability. J. Log. Algebr. Program. 79(3-5), 233–244 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  14. Müller, R.: On the notion of deadlocks in open nets. In: AWPN 2010. CEUR WS Proc., vol. 643, pp. 130–135 (2010)

    Google Scholar 

  15. Papazoglou, M.P.: Web Services: Principles and Technology. Pearson (2007)

    Google Scholar 

  16. Reed, J.N., Roscoe, A.W., Sinclair, J.E.: Responsiveness and stable revivals. Formal Asp. Comput. 19(3), 303–319 (2007)

    Article  MATH  Google Scholar 

  17. Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125–198 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Stahl, C., Vogler, W.: A trace-based service semantics guaranteeing deadlock freedom. Acta Inf. 49(2), 69–103 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  19. Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    Book  Google Scholar 

  20. Vogler, W., Stahl, C., Müller, R.: A trace-based semantics for responsiveness. In: ACSD 2012, pp. 42–51. IEEE (2012)

    Google Scholar 

  21. Wolf, K.: Does my service have partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W., Stahl, C., Müller, R. (2013). Trace- and Failure-Based Semantics for Bounded Responsiveness. In: Canal, C., Villari, M. (eds) Advances in Service-Oriented and Cloud Computing. ESOCC 2013. Communications in Computer and Information Science, vol 393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45364-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45364-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45363-2

  • Online ISBN: 978-3-642-45364-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics