Skip to main content
Springer Nature Link
Log in

Probabilistic Programming with Coordination

  • Chapter
  • First Online:
Reflections on the Work of C.A.R. Hoare

  • 612 Accesses

Abstract

Failure is the typical phenomenon of the execution of long-running transactions. To accommodate the random features of internet-based computing this paper concentrates on adding probabilistic behaviour to the Dijkstra’s Guarded Command Language. We introduce probabilistic choice and coordination operators, and extend standard states to probabilistic states by replacing the final state with a final distribution. This paper explores algebraic properties of the new programming combinators, and shows how to convert programs to normal forms algebraically.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Bulter, M.J., Ferreria, C.: An Operational Semantics for StAC: a Language for Modelling Long-Running Business Transactions. Lecture Notes in Computer Science, vol. 2949, pp. 87–104, Springer (2004).

    Article  Google Scholar 

  2. Curbera, F., Goland, Y., Klein, J., et al.: Business Process Execution Language for Web Service. http://www.siebei.com/bpel. (2003).

    Google Scholar 

  3. Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ (1976).

    MATH  Google Scholar 

  4. Hoare, C.A.R., He Jifeng.: Unifying Theories of Programming. Prentice Hall, London (1998)

    Google Scholar 

  5. Jones, C.B.: Systematic Software Development Using VDM. Prentice-Hall, New York (1986).

    MATH  Google Scholar 

  6. Leymann, F.: Web Service Flow Language (WSFL1.0). IBM, (2001)

    Google Scholar 

  7. Moggi, E.: Notations of computation and monads. Inform. Comput. 93, 55–92 (1986).

    Article  MathSciNet  Google Scholar 

  8. Morris, J.M.: Non-deterministic expressions and predicate transformers. Inform. Process. Lett. 61, 241–246 (1997).

    Article  MathSciNet  Google Scholar 

  9. Thatte, S.: XLANG: Web Service for Business Process Design. Microsoft, Redmond (2001).

    Google Scholar 

Download references

Acknowledgements

This work was supported by the National Basic Research Program of China (Grant No. 2005CB321904), National Natural Science Foundation of China (No. 90718004) and Shanghai Leading Academic Discipline Project B412.

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China

    He Jifeng

Authors
  1. He Jifeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to He Jifeng .

Editor information

Editors and Affiliations

  1. Oxford University Computing Laboratory, Parks Road, Oxford, OX13QD, United Kingdom

    A.W. Roscoe

  2. Dept. Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, NE17RU, United Kingdom

    Cliff B. Jones

  3. Microsoft Research Ltd., J. J. Thomson Avenue 7, Cambridge, CB30FB, United Kingdom

    Kenneth R. Wood

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer London

About this chapter

Cite this chapter

Jifeng, H. (2010). Probabilistic Programming with Coordination. In: Roscoe, A., Jones, C., Wood, K. (eds) Reflections on the Work of C.A.R. Hoare. Springer, London. https://doi.org/10.1007/978-1-84882-912-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-912-1_6

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-911-4

  • Online ISBN: 978-1-84882-912-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics