Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model
نویسندگان
چکیده
This paper presents a Banach space based approach towards a denotational semantics of a probabilistic constraint programming language. This language is based on the concurrent constraint programming paradigm, where randomness is introduced by means of a probabilis-tic choice construct. As a result, we obtain a declarative framework, in which randomised algorithms can be expressed and formalised. The de-notational model we present is constructed by using functional-analytical techniques. As an example, the existence of xed-points is guaranteed by the Brouwer-Schauder Fixed-Point Theorem. A concrete xed-point construction is also presented which corresponds to a notion of observables capturing the exact results of both nite and innnite computations.
منابع مشابه
Probabilistic Concurrent Constraint Programming
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 ...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملA Markov Model for Probabilistic Concurrent Constraint Programming
This paper introduces a new approach towards the semantics of Concurrent Constraint Programming (CCP), which is based on operator algebras. In particular , we show how stochastic matrices can be used for modelling both a quantitative version of nondeterminism (in the form of a probabilistic choice) and synchronisa-tion. We will assume Probabilistic Concurrent Constraint Programming (PCCP) as th...
متن کاملA Timed Concurrent Constraint Language
We study a timed concurrent constraint language, called tccp, which is obtained by a natural timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next-time operator and the parallel execution of agents follows the scheduling policy of maximal parallelism. Additionally, tccp includes a simple primitive which allows one to specify timing constraints. We define ...
متن کاملForgetting causality in the concurrent game semantics of probabilistic PCF
We enrich thin concurrent games with symmetry, recently introduced by Castellan et al, with probabilities, and build on top of it a cartesian closed category with an interpretation of Probabilistic PCF (PPCF). Exploiting that the strategies obtained from PPCF terms have a deadlock-free interaction, we deduce that there is a functor preserving the interpretation from our games to the probabilist...
متن کامل