Sciweavers

Share
CONCUR
1997
Springer

Probabilistic Concurrent Constraint Programming

12 years 3 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the speciļ¬cation 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 denotationalmodel of pcc (resp. Timed pcc) is conservative over cc (resp. tcc). We also show that the denotational models are stract for an operational semantics that records probability information.
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1997
Where CONCUR
Authors Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
Comments (0)
books