Skip to main content
SpringerLink
Log in

Stochastic Reasoning About Channel-Based Component Connectors

  • Conference paper
Coordination Models and Languages (COORDINATION 2006)

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

Included in the following conference series:

Abstract

Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a network of channels. In this paper, we introduce a variant of constraint automata (called continuous-time constraint automata) that allows us to specify time-dependent stochastic assumptions about the channel connections or the component interfaces, such as the arrival rates of communication requests, the average delay of enabled I/O-operations at the channel ends or the stochastic duration of internal computations. This yields the basis for a performance analysis of channel-based coordination mechanisms. We focus on compositional reasoning and discuss several bisimulation relations on continuous-time constraint automata. For this, we adapt notions of strong and weak bisimulation that have been introduced for similar stochastic models and introduce a new notion of weak bisimulation which abstracts away from invisible non-stochastic computations as well as the internal stochastic evolution.

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. Arbab, F.: Abstract behavior types: A foundation model for components and their composition. In: [15], pp. 33–70 (2003)

    Google Scholar 

  2. Arbab, F.: Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science 14(3), 1–38 (2004)

    Article  MathSciNet  Google Scholar 

  3. Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Proc. SEFM 2004. IEEE CS Press, Los Alamitos (2004)

    Google Scholar 

  4. Arbab, F., Baier, C., Rutten, J.J.M.M., Sirjani, M.: Modeling component connectors in reo by constraint automata. Science of Computer Programming, special issue on Foundations of Coordination Languages and Software Architectures (to appear, 2005)

    Google Scholar 

  5. Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Baier, C.: Probabilistic models for reo connector circuits. Journal of Universal Computer Science 11(10), 1718–1748 (2005)

    Google Scholar 

  7. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time markov decision processes. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 61–76. Springer, Heidelberg (2004) (Full version to appear in Theoretical Computer Science)

    Chapter  Google Scholar 

  8. Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching time semantics for Markov chains. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 492–507. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Bernardo, M., Gorrieri, R.: Extended Markovian process algebra. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 315–330. Springer, Heidelberg (1996)

    Google Scholar 

  10. Bohnenkamp, H., Hermanns, H., Katoen, J.-P., Klaren, R.: The modest modeling tool and its implementation. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 116–133. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Bravetti, M.: Revisiting interactive Markov chains. In: Proc. Models for Time-Critical Systems. Electr. Notes Theor. Comput. Sci., vol. 68(5) (2003)

    Google Scholar 

  12. Buchholz, P.: Exact and ordinary lumpability in finite markov chains. Journal of Applied Probability 31, 59–75 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ciancarini, P.: Coordination models and languages as software integrators. ACM Comput. Surv. 28(2), 300–302 (1996)

    Article  Google Scholar 

  14. Clarke, D., Costa, D., Arbab, F.: Modelling coordination in biological systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol. 4313, pp. 9–25. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2002. LNCS, vol. 2852. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  16. Di Pierro, A., Hankin, C., Wiklicky, H.: Continuous-time probabilistic klaim. Electr. Notes Theor. Comput. Sci. 128(5), 27–38 (2005)

    Article  Google Scholar 

  17. Diakov, N., Arbab, F.: Compositional construction of web services using Reo. In: Proc. International Workshop on Web Services: Modeling, Architecture and Infrastructure (ICEIS 2004), Porto, Portugal, April 13-14 (2004)

    Google Scholar 

  18. Feinberg, E.: Continuous time discounted jump markov decision processes: A discrete-event approach. Math. Oper. Res. 29(3), 492–524 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gelernter, D., Carriero, N.: Coordination languages and their significance. Commun. ACM 35(2), 97–107 (1992)

    Article  Google Scholar 

  20. Hermanns, H.: Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  21. Hillston, J.: A compositional approach to performance modelling. Cambridge University Press, Cambridge (1996)

    Book  Google Scholar 

  22. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. D. Van Nostrand Co., Princeton (1966)

    MATH  Google Scholar 

  23. Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  24. Nierstrasz, O., Gibbs, S., Tsichritzis, D.: Component-oriented software development. Commun. ACM 35(9), 160–165 (1992)

    Article  Google Scholar 

  25. Omicini, A., Zambonelli, F., Klusch, M., Tolksdorf, R. (eds.): Coordination of Internet Agents: Models, Technologies, and Applications. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  26. Panangaden, P.: Measure and probability for concurrency theorists. Theoretical Computer Science 253(2), 287–309 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  27. Priami, C.: Stochastic pi-calculus. Comput. J. 38(7), 578–589 (1995)

    Article  Google Scholar 

  28. Puterman, M.L.: Markov Decision Processes—Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York (1994)

    MATH  Google Scholar 

  29. Rutten, J.J.M.M.: Component connectors. In: [27], ch. 5, pp. 73–87. Oxford University Press, Oxford (2004)

    Google Scholar 

  30. Wolf, V., Baier, C., Majster-Cederbaum, M.: Trace semantics for stochastic systems with nondeterminism. In: Proc. QAPL (to appear, 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bonn, Germany

    Christel Baier

  2. Universität Mannheim, Germany

    Verena Wolf

Authors
  1. Christel Baier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Verena Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CS Dept, University of Bologna, Mura Zamboni 7, 40126, Bologna, Italy

    Paolo Ciancarini

  2. Imperial College London, 180 Queen’s Gate, SW7 2AZ, London, UK

    Herbert Wiklicky

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baier, C., Wolf, V. (2006). Stochastic Reasoning About Channel-Based Component Connectors. In: Ciancarini, P., Wiklicky, H. (eds) Coordination Models and Languages. COORDINATION 2006. Lecture Notes in Computer Science, vol 4038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767954_1

Download citation

  • DOI: https://doi.org/10.1007/11767954_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34694-4

  • Online ISBN: 978-3-540-34695-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation