Loading...
Please wait, while we are loading the content...
Similar Documents
Probabilistic Concurrent Constraint Programming (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gupta, Vineet Jagadeesan, Radha Saraswat, Vijay |
| Description | In Proceedings of CONCUR 97 . 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 of pcc (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. 1 Introduction Concurrent constraint programming(CCP, [Sar93]) is an approach to computation which uses constraints for the compositional specification of concurrent systems. It replaces the traditional notion of a store as a valuation of variables with the notion of a store as a cons... |
| File Format | |
| Language | English |
| Publisher | Springer Verlag |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Introduction Concurrent Constraint Programming Traditional Notion Parallel Composition Timed Pcc Key Feature Random Variable Probabilistic Concurrent Constraint Programming Compositional Specification Probability Information Default Reasoning Concurrent System Operational Semantics Denotational Model Synchronous Reactive Probabilistic Programming Language Discrete Probability Distribution |
| Content Type | Text |
| Resource Type | Article |
