Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1997: CONCUR '97: Concurrency Theory pp 243–257Cite as

Probabilistic concurrent constraint programming

  • Contributions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1243))

Abstract

We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators for default reasoning. We extend pcc uniformly over time, to get a synchronous reactive probabilistic programming language, Timed pcc. We describe operational and denotational models for pcc (and Timed pcc). The key feature of the denotational model(s) is that parallel composition is essentially set intersection. We show that the denotational model ofpcc (resp. Timed pcc) is conservative over cc (resp. tcc). We also show that the denotational models are fully abstract for an operational semantics that records probability information.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. Interaction categories. Available by anonymous ftp from papers/Abramsky:theory.doc.ic.ac.uk, 1993.

    Google Scholar 

  2. Samson Abramsky. Interaction categories and communicating sequential processes. In A. W. Roscoe, editor, A Classical Mind: Essays in honour of C.A. R. Hoare, pages 1–16. Prentice Hall International, 1994.

    Google Scholar 

  3. A. Benveniste and G. Berry. The synchronous approach to reactive and real-time systems. In Special issue on Another Look at Real-time Systems, Proceedings of the IEEE, September 1991.

    Google Scholar 

  4. Albert Benveniste, Bernard C. Levy, Eric Fabre, and Paul Le Guernic. A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems. Theoretical Computer Science, 152(2):171–217, Dec 1995.

    Google Scholar 

  5. R. Cleaveland, S. A. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. Lecture Notes in Computer Science, 623, 1992.

    Google Scholar 

  6. Johan de Kleer and Brian C. Williams. Diagnosis with behavioral modes. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 1324–1330, August 1989.

    Google Scholar 

  7. M. Fromherz, D. Bell, D. Bobrow, et al. Rapper: The Copier Modeling Project. In Working Papers of the Eighth International Workshop on Qualitative Reasoning About Physical Systems, pages 1–12, June 1994.

    Google Scholar 

  8. R. Fagin, J.Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Information and Computation, 87:78–128, 1990.

    Google Scholar 

  9. Markus PJ. Fromherz and Vijay A. Saraswat. Model-based computing: Using concurrent constraint programming for modeling and model compilation. In U. Montanari and F. Rossi, editors, Principles and Practice of Constraint Programming — CP'95, pages 629–635. Springer-Verlag, LNCS 976, Sept. 1995.

    Google Scholar 

  10. Vineet Gupta, Radha Jagadeesan, and Vijay Saraswat. Computing with continuous change. Science of Computer Programming. To appear.

    Google Scholar 

  11. Vineet Gupta, Vijay Saraswat, and Peter Struss. A model of a photocopier paper path. In Proceedings of the 2nd IJCAI Workshop on Engineering Problems for Qualitative Reasoning, August 1995.

    Google Scholar 

  12. N. Halbwachs. Synchronous programming of reactive systems. The Kluwer international series in Engineering and Computer Science. Kluwer Academic publishers, 1993.

    Google Scholar 

  13. D. Harel. Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231–274, 1987.

    Google Scholar 

  14. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 278–287. IEEE Computer Society Press, 1990.

    Google Scholar 

  15. S. Hart and M. Shark. Probabilistic propositional temporal logics. Information and Control, 70:97–155, 1986.

    Google Scholar 

  16. Pascal Van Hentenryck, Vijay A. Saraswat, and Yves Deville. Constraint processing in CC(fd). Technical report, Computer Science Department, Brown University, 1992.

    Google Scholar 

  17. P. T. Johnstone. Stone Spaces, volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982.

    Google Scholar 

  18. C. Jones and G. D. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 186–195, Asilomar Conference Center, Pacific Grove, California, 1989.

    Google Scholar 

  19. Bengt Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 431–441, San Diego, California, 1995.

    Google Scholar 

  20. Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, September 1991.

    Google Scholar 

  21. M. Ajmone Marsan. Stochastic petri nets: an elementary introduction. In Advances in Petri Nets 1989, pages 1–29. Springer, June 1989.

    Google Scholar 

  22. Carroll Morgan, Annabelle McIver, and Karen Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325–353, May 1996.

    Google Scholar 

  23. N.J. Nilsson. Probabilistic logic. Artificial Intelligence, 28:71–87, 1986.

    Google Scholar 

  24. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann Publishers, 1988.

    Google Scholar 

  25. Vijay A. Saraswat. Concurrent constraint programming. Doctoral Dissertation Award and Logic Programming Series. MIT Press, 1993.

    Google Scholar 

  26. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation. To appear. Extended abstract appeared in the Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, January 1995.

    Google Scholar 

  27. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Foundations of Timed Concurrent Constraint Programming. In Samson Abramsky, editor, Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Press, July 1994.

    Google Scholar 

  28. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando, January 1991.

    Google Scholar 

  29. Rob van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 130–141, Philadelphia, Pennsylvania, 1990.

    Google Scholar 

  30. N. Viswanadham and Y. Narahari. Performance Modeling of Automated Manufacturing Systems. Prentice-Hall Inc., 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox PARC, 3333 Coyote Hill Road, 94304, Palo Alto, CA

    Vineet Gupta

  2. Department of Mathematics, Loyola University-Lake Shore Campus, 60626, Chicago, IL

    Radha Jagadeesan

  3. AT & T Research, 180 Park Avenue, 07932, Florham Park, NJ

    Vijay Saraswat

Authors
  1. Vineet Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay Saraswat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, V., Jagadeesan, R., Saraswat, V. (1997). Probabilistic concurrent constraint programming. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation