Article

Free access

Stochastic processes as concurrent constraint programs

Authors:

Radha Jagadeesan, and

Prakash PanangadenAuthors Info & Claims

POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1999

Pages 189 - 202

https://doi.org/10.1145/292540.292558

Published: 01 January 1999 Publication History

Abstract

This paper describes a stochastic concurrent constraint language for the description and programming of concurrent probabilistic systems. The language can be viewed both as a calculus for describing and reasoning about stochastic processes and as an executable language for simulating stochastic processes. In this language programs encode probability distributions over (potentially infinite) sets of objects. We illustrate the subtleties that arise from the interaction of constraints, random choice and recursion. We describe operational semantics of these programs (programs are run by sampling random choices), denotational semantics of programs (based on labeled transition systems and weak probabilistic bisimulation), and prove soundness theorems. We show that Probabilistic CC is conservative over CC, thus justifying the design of Probabilistic CC. We use the semantic study to illustrate a novel use of probability to analyze a problem stated without reference to probability, namely the problem of indeterminacy in synchronous programs.

References

[1]

H. Abelson, T. E Knight, and G. J. Sussman. Amorphous computing manifesto, http://www-swiss.ai.mit.edu/switz/amorphous/whitepaper/amorph-new/amorph-new.html, 1996.]]

[2]

A. Aghasaryan, R. Boubour, E. Fabre, C. Jard, and A. Benveniste. A petri net approach to fault detection and diagnosis in distributed systems. Technical Report PI-1117, IRISA -- Institut de recherche en informatique et systemes aleatoires - Rennes, 1997.]]

[3]

Rajeev Alur, Lalita Jategaonkar Jagadeesan, Joseph J. Kott, and James E. Von Olnhausen. Model-checking of real-time systems: A telecommunications application. In Proceedings of the 19th International conference on Software Engineering, pages 514-524, 1997.]]

Digital Library

[4]

Robert B. Ash. Real Analysis and Probability. Academic Press, 1972.]]

[5]

J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: Acp with generative probabilities. Information and Computation, 121(2):234-255, 1995.]]

Digital Library

[6]

Christel Baier, Ed Clark, Vasiliki Hartonas-Garmhausen, Marta Kwiatkowska, and Mark Ryan. Symbolic model checking for probabilistic processes. In Proceedings of the 24th international Colloquium On Automata Languages And Programming, number 1256 in Lecture Notes In Computer Science, pages 430-440, 1997.]]

Digital Library

[7]

A. Benveniste and G. Berry, editors. Another Look at Real-time Systems, volume 79:9, September 1991.]]

[8]

A. Benveniste and G. Berry. The synchronous approach to reactive and real-time systems. In Proceedings of the IEEE {7}, pages 1270-- 1282.]]

[9]

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.]]

Digital Library

[10]

A. Berlin, H. Abelson, N. Cohen, L. Fogel, C-H, Ho, M. Horowitz, J. How, T. F. Knight, R. Newton, and K, Pistel. Distributed information systems for mems. Technical report, Xerox Palo Alto Research Center, 1995.]]

[11]

G. Berry. Preemption in concurrent systems. In R. K. Shyamasundar, editor, Proc. of FSTTCS, pages 72-93. Springer-Verlag, 1993. LNCS 761.]]

Digital Library

[12]

G. Berry and G. Gonthier. The ESTEREL programming language: Design, semantics and implementation. Science of Computer Programming, 19(2):87- 152, November 1992.]]

Digital Library

[13]

A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems, In P. S. Thiagarajan, editor, Proceedings of the 15th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, number 1026 in Lecture Notes In Computer Science, pages 499-513, 1995.]]

Digital Library

[14]

Patrick Billingsley. Probability and Measure. Wiley-Interscience, 1995.]]

[15]

Richard Blute, Jos6e Desharnais, Abbas Edalat, and Prakash Panangaden. Bisimulation for labelled markov processes. In Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 1997.]]

Digital Library

[16]

J. Dean Brock and W. B. Ackerman. Scenarios: A model of nondeterminate computation. In J. Diaz and I. Ramos, editors, International Colloquium on Formalization of Programming Concepts, pages 252-259. Springer-Verlag, 1981. Lect. Notes in Comp. Sci. 107,]]

[17]

Bjom Carlson, Vineet Gupta, and Tadd Hogg. Controlling agents in smart matter with global constraints. In Proceedings of the AAAI Workshop on Constraints and Agents, July 1997.]]

[18]

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

Digital Library

[19]

D. Coore, R. Nagpal, and R. Weiss, Paradigms for structure in an amorphous computer. Technical Report AI Memo 1614, MIT, 1997.]]

Digital Library

[20]

C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.]]

Digital Library

[21]

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.]]

[22]

Josee Desharnais, Abbas Edalat, and Prakash Panangaden. A logical characterization of bisimulation for labeled markov processes. In Proceedings of the 13th IEEE Symposium On Logic In Computer Science, indianapolis. IEEE Press, June 1998.]]

Digital Library

[23]

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

Digital Library

[24]

Erann Gat. Towards principled experimental study of autonomous mobile robots. Autonomous Robots, 2:179-189, 1995.]]

[25]

E Le Guemic, M. Le Borgne, T. Gauthier, and C. Le Maire. Programming real time applications with SIGNAL. In Proceedings of the IEEE {7}, pages 1321-1336.]]

[26]

Vineet Gupta, Radha Jagadeesan, and Vijay Saraswat. Probabilistic concurrent constraint programming. In Antoni Mazurkiewicz and Jozef Winkowski, editors, CONCUR'97: Concurrency Theory, Lecture notes in computer science, vol 1243. Springer Vedag, August 1997.]]

Digital Library

[27]

Vineet Gupta, Radha Jagadeesan, and Vijay Saraswat. Computing with continuous change. Science of Computer Programming, 30( 1- 2):3-50, 1998.]]

Digital Library

[28]

Vineet Gupta, Radha Jagadeesan, Vijay Saraswat, and Daniel Bobrow. Programming in hybrid constraint languages. In Panos Antsaklis, Wolf Kohn, Anil Nerode, and Sankar Sastry, editors, Hybrid Systems II, volume 999 of Lecture notes in computer science. Springer Verlag, November 1995.]]

Digital Library

[29]

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.]]

[30]

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

Digital Library

[31]

N. Halbwachs, E Caspi, and D. Pilaud. The synchronous programming language LUSTRE. In Proceedings of the IEEE {7}, pages 1305- 1320.]]

[32]

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

[33]

D. Hard. Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231 - 274, 1987.]]

Digital Library

[34]

S. Hart and M. Sharir. Probabilistic propositional temporal logics. Information and Control, 70:97-I55, 1986.]]

Digital Library

[35]

M. Hayden and K. Birman. Probabilistic broadcast. Technical Report TR96-1606, Comell University, 1996.]]

Digital Library

[36]

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

[37]

Jane Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994. To be published as a Distinguished Dissertation by Cambridge University Press.]]

Digital Library

[38]

Michael Huth and Marta Kwiatkowska. Quantitative analysis and model checking. In proceedings of the 12 IEEE Symposium On Logic in Computer Science, pages i 11-122. IEEE Press, 1997.]]

Digital Library

[39]

Sverker Janson and Seif Haridi. Programming Paradigms of the Andorra Kernel Language. In Logic Programming: Proceedings of the 1991 International Symposium, pages 167-186. MIT Press, 1991.]]

[40]

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.]]

Digital Library

[41]

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.]]

Digital Library

[42]

D. Koller, D. McAllester, and A. Pfeffer. Effective bayesian inference for stochastic programs. In Proceedings of the 14th National Conference on Artificial intelligence (AAAI), pages 740-747, 1997.]]

[43]

Kim G. Larsen and Ame Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.]]

Digital Library

[44]

J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.]]

Digital Library

[45]

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

Digital Library

[46]

Ramon E. Moore. Interval Analysis. Prentice-Hall, 1966.]]

[47]

Carroll Morgan, Annabelle Mclver, and Karen Seidel. Probabilistic predicate transformers. A CM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.]]

Digital Library

[48]

R. Nagpal and D. Coore. An algorithm for group formation and finding a maximal independent set in an amorphous computer. Technical Report LCS-TR-737, MIT, 1998.]]

Digital Library

[49]

N. J. Nilsson. Probabilistic logic. Artificial Intelligence, 28:71-87, 1986.]]

Digital Library

[50]

P. Panangaden. The expressive power of indeterminate primitives in asynchronous computation. In P. S. Thiagarajan, editor, Proceedings of the Fifteenth Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes In Computer Science, 1995. Invited Lecture.]]

Digital Library

[51]

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

Digital Library

[52]

J.R. Russell. Full abstraction for nondeterministic dataflow networks. In Proceedings of the 30th Annual Symposium of Foundations of Computer Science, pages 170--177, 1989.]]

Digital Library

[53]

V. A. Saraswat, R. Jagadeesan, and V. Gupta. Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, 22(5-6):475-520, November/December 1996. Extended abstract appeared in the Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, January 1995.]]

Digital Library

[54]

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, pages 333-352, January 1991.]]

Digital Library

[55]

Vijay A. Saraswat. The Category of Constraint Systems is Cartesianclosed. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, 1992.]]

[56]

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

Digital Library

[57]

Dana Scott. Lattice theory, data types and semantics. In Randall Rustin, editor, Formal Semantics and Programming Languages, pages 65-106. Prentice Hall, 1972.]]

[58]

R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995. Also appears as technical report MIT/LCS/TR-676.]]

Digital Library

[59]

G.E. Shilov and B. L. Gurevich. integral, Measure and Derivative: A Unified Approach. Prentice-Hall Inc., 1966.]]

[60]

Gert Smolka, M. Henz, and J. Werz. Constraint Programming: The Newport Papers, chapter Object-oriented programming in Oz. MIT Press, 1994.]]

[61]

R. van Glabbeek, S.A. Smolka, and B.U. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 1995.]]

Digital Library

[62]

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

Digital Library

[63]

S.-H. Wu, S.A. Smolka, and E. Stark. Compositionality and full abstraction for probabilistic i/o automata. Theoretical Computer Science, 1996. Preliminary version in CONCUR94.]]

Cited By

Benveniste ARaclet J(2023)Mixed Nondeterministic-Probabilistic AutomataDiscrete Event Dynamic Systems10.1007/s10626-023-00375-x33:4(455-505)Online publication date: 19-Oct-2023
https://doi.org/10.1007/s10626-023-00375-x
Panangaden P(2023)Structure in Machine LearningSamson Abramsky on Logic and Structure in Computer Science and Beyond10.1007/978-3-031-24117-8_30(1147-1157)Online publication date: 2-Aug-2023
https://doi.org/10.1007/978-3-031-24117-8_30
Bacci GFurber RKozen DMardare RPanangaden PScott D(2018)Boolean-Valued Semantics for the Stochastic λ-CalculusProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209175(669-678)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209175
Show More Cited By

Index Terms

Stochastic processes as concurrent constraint programs

Recommendations

Proving concurrent constraint programs correct
POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We develop a compositional proof-system for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. ...
Read More
Imprecise stochastic processes in discrete time

We justify and discuss expressions for joint lower and upper expectations in imprecise probability trees, in terms of the sub- and supermartingales that can be associated with such trees. These imprecise probability trees can be seen as discrete-time ...
Read More
Proving concurrent constraint programs correct

We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest postcondition semantics of CCP programs. The proof ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1999

324 pages

ISBN:1581130953

DOI:10.1145/292540

Chairmen:
Andrew Appel
Princeton Univ., Princeton, NJ
,
Alex Aiken
Univ. of California, Berkeley

Copyright © 1999 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL99

Sponsor:

POPL99: Symposium on Prinicples of Programming Languages 1999

January 20 - 22, 1999

Texas, San Antonio, USA

Acceptance Rates

POPL '99 Paper Acceptance Rate 24 of 136 submissions, 18%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
1,902
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

Benveniste ARaclet J(2023)Mixed Nondeterministic-Probabilistic AutomataDiscrete Event Dynamic Systems10.1007/s10626-023-00375-x33:4(455-505)Online publication date: 19-Oct-2023
https://doi.org/10.1007/s10626-023-00375-x
Panangaden P(2023)Structure in Machine LearningSamson Abramsky on Logic and Structure in Computer Science and Beyond10.1007/978-3-031-24117-8_30(1147-1157)Online publication date: 2-Aug-2023
https://doi.org/10.1007/978-3-031-24117-8_30
Bacci GFurber RKozen DMardare RPanangaden PScott D(2018)Boolean-Valued Semantics for the Stochastic λ-CalculusProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209175(669-678)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209175
Olmedo FGretz FJansen NKaminski BKatoen JMciver A(2018)Conditioning in Probabilistic ProgrammingACM Transactions on Programming Languages and Systems10.1145/315601840:1(1-50)Online publication date: 3-Jan-2018
https://dl.acm.org/doi/10.1145/3156018
Ramírez SRomero MRocha CValencia F(2018)Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint ProgrammingRewriting Logic and Its Applications10.1007/978-3-319-99840-4_13(226-244)Online publication date: 8-Sep-2018
https://doi.org/10.1007/978-3-319-99840-4_13
Olmedo FKaminski BKatoen JMatheja CKoskinen EGrohe MShankar N(2016)Reasoning about Recursive Probabilistic ProgramsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2935317(672-681)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2935317
Panangaden P(2016)Fond and Frank Memories of FrankEssays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 966010.1007/978-3-319-30734-3_2(6-8)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/978-3-319-30734-3_2
Jansen NKaminski BKatoen JOlmedo FGretz FMcIver A(2015)Conditioning in Probabilistic ProgrammingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2015.12.013319:C(199-216)Online publication date: 21-Dec-2015
https://dl.acm.org/doi/10.1016/j.entcs.2015.12.013
Gordon AAizatulin MBorgstrom JClaret GGraepel TNori ARajamani SRusso C(2013)A model-learner pattern for bayesian reasoningACM SIGPLAN Notices10.1145/2480359.242911948:1(403-416)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429119
Gordon AAizatulin MBorgstrom JClaret GGraepel TNori ARajamani SRusso CGiacobazzi RCousot R(2013)A model-learner pattern for bayesian reasoningProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429119(403-416)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2429069.2429119
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents