Skip to main content
SpringerLink
Log in

Probabilistic CSP: Preserving the Laws via Restricted Schedulers

  • Conference paper
Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB&DFT 2012)

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

Abstract

Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for internal choice, in the presence of probabilistic choice, has been an open problem so far. The problem stems from a well known disagreement between probabilistic choice and nondeterministic choice, that raises congruence issues for parallel composition. Recently, it has been argued that the congruence issue can be resolved only by restricting the power of the schedulers that resolve the nondeterminism. In our previous work, we have restricted the schedulers by suitably labeling the nondeterministic transitions. We have defined a ready-trace equivalence and a parallel composition with hiding for which the equivalence is a congruence. In this paper, we generalize our model and give a CSP-style axiomatic characterization of the ready-trace equivalence. From the axiomatization it follows that all distributivity axioms for internal choice from CSP are preserved, and no new axioms are added.

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

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.

Similar content being viewed by others

References

  1. Andrés, M.E., Palamidessi, C., van Rossum, P., Sokolova, A.: Information hiding in probabilistic concurrent systems. Theor. Comp. Sc. 412(28), 3072–3089 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Ready-trace semantics for concrete process algebra with the priority operator. The Comp. Journal 30(6), 498–506 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Caillaud, B., Delahaye, B., Larsen, K., Legay, A., Pedersen, M., Wasowski, A.: Constraint markov chains. Theor. Comp. Sc. 412(34), 4373–4404 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. Information and Computation 208(6), 694–715 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theor. Comp. Sc. 365(1-2), 83–108 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. de Alfaro, L., Henzinger, T., Jhala, R.: Compositional Methods for Probabilistic Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 351–365. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Comp. Sc. 4(4:4), 1–33 (2008)

    MathSciNet  MATH  Google Scholar 

  9. Doob, J.L.: Stochastic Processes. John Wiley and Sons, New York (1953)

    MATH  Google Scholar 

  10. Georgievska, S.: Probability and Hiding in Concurrent Processes. PhD thesis, Eindhoven University of Technology (2011)

    Google Scholar 

  11. Georgievska, S., Andova, S.: Composing Systems While Preserving Probabilities. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds.) EPEW 2010. LNCS, vol. 6342, pp. 268–283. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Georgievska, S., Andova, S.: Retaining the Probabilities in Probabilistic Testing Theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 79–93. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Georgievska, S., Andova, S.: Probabilistic CSP: Preserving the laws via restricted schedulers. Technical Report (2011), http://www.win.tue.nl/~sgeorgie/axioms2011_long.pdf

  14. Giro, S., D’Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: QAPL 2009. ENTCS, vol. 253(3), pp. 45–71 (2009)

    Google Scholar 

  15. Giro, S., D’Argenio, P., Ferrer Fioriti, L.M.: Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 338–353. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Giro, S., D’Argenio, P.R.: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 179–194. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Gomez, F.C., De Frutos Escrig, D., Ruiz, V.V.: A Sound and Complete Proof System for Probabilistic Processes. In: Rus, T., Bertrán, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol. 1231, pp. 340–352. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)

    Google Scholar 

  19. Kwiatkowska, M., Norman, G.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. ENTCS, vol. 16(2), pp. 1–19 (1998)

    Google Scholar 

  20. Kwiatkowska, M.Z., Norman, G.J.: A fully abstract metric-space denotational semantics for reactive probabilistic processes. In: COMPROX 1998. ENTCS, vol. 13, pp. 1–33 (1998)

    Google Scholar 

  21. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94, 1–28 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lindley, D.V.: Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press (1980)

    Google Scholar 

  23. Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford University Computing Labs (1993)

    Google Scholar 

  24. Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)

    Book  MATH  Google Scholar 

  25. Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinement-oriented probability for CSP. Formal Aspects of Computing 8(6), 617–647 (1996)

    Article  MATH  Google Scholar 

  26. Pnueli, A.: Linear and Branching Structures in the Semantics and Logics of Reactive Systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 15–32. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  27. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)

    Google Scholar 

  28. Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, MIT (1995)

    Google Scholar 

  29. Seidel, K.: Probabilistic communicating processes. Theor. Comp. Sc. 152, 219–249 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  30. Wang, Y., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII, pp. 47–61 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands

    Sonja Georgievska & Suzana Andova

Authors
  1. Sonja Georgievska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suzana Andova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. disco - Distributed Computer Systems Lab, Computer Science Department, University of Kaiserslautern, Building 36, P.O. Box 3049, 67663, Kaiserslautern, Germany

    Jens B. Schmitt

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgievska, S., Andova, S. (2012). Probabilistic CSP: Preserving the Laws via Restricted Schedulers. In: Schmitt, J.B. (eds) Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. MMB&DFT 2012. Lecture Notes in Computer Science, vol 7201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28540-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28540-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28539-4

  • Online ISBN: 978-3-642-28540-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation