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 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
|
4388
|
Probabilistic Reasoning in Intelligent Systems
– Pearl
- 1988
|
|
330
|
Bisimulation through probabilistic testing
– Larsen, Skou
- 1991
|
|
314
|
Probabilistic logic
– Nilsson
|
|
283
|
The Synchronous Approach to Reactive and Real-Time Systems
– Benveniste, Berry
- 1991
|
|
245
|
Semantics foundations of concurrent constraint programming
– Saraswat, Rinard, et al.
- 1991
|
|
159
|
A logic for reasoning about probabilities
– Fagin, Halpern, et al.
- 1990
|
|
153
|
Diagnosing with behavioral modes
– Kleer, Williams
- 1989
|
|
146
|
Statecharts: A Visual Approach to Complex Systems
– Harel
- 1987
|
|
144
|
Reactive, generative, and stratified models of probabilistic processes
– Glabbeek, Smolka, et al.
- 1995
|
|
102
|
A probabilistic powerdomain of evaluations
– Jones, Plotkin
- 1989
|
|
95
|
Probabilistic predicate transformers
– MORGAN, MCIVER, et al.
- 1996
|
|
89
|
A calculus for communicating systems with time and probabilities
– Hansson, Jonsson
- 1990
|
|
74
|
Constraint processing in cc(fd
– Hentenryck, Saraswat, et al.
- 1992
|
|
71
|
Foundations of timed concurrent constraint programming
– Saraswat, Jagadeesan, et al.
- 1994
|
|
62
|
Timed default concurrent constraint programming
– Saraswat, Jagadeesan, et al.
- 1996
|
|
51
|
Testing preorders for probabilistic processes
– Cleaveland, Smolka, et al.
- 1992
|
|
46
|
Stochastic petri nets: An elementary introduction
– Marsan
- 1989
|
|
44
|
Compositional testing preorders for probabilistic processes
– Jonsson, Yi
- 1995
|
|
43
|
Performance Modelling of Automated Manufacturing Systems
– Viswanadham, Narahari
- 1994
|
|
37
|
Interaction categories and communicating sequential processes
– Abramsky
- 1994
|
|
35
|
Theory of capacities
– Choquet
|
|
26
|
Synchronous programming of reactive systems. The Kluwer international series in Engineering and Computer Science.Kluwer Academic publishers
– Halbwachs
- 1993
|
|
21
|
Spaces, volume 3 of Cambridge
– Stone
- 1982
|
|
20
|
Probabilistic propositional temporal logic, Information and Control
– Hart, Sharir
- 1986
|
|
14
|
A model of a photocopier paper path
– Saraswat, Struss
- 1995
|
|
13
|
Concurrent constraint programming. Doctoral Dissertation Award and Logic Programming Series
– Saraswat
- 1993
|
|
10
|
Model-based computing: using concurrent constraint programming for modeling and model compilation
– Fromherz, Saraswat
- 1995
|
|
9
|
Radha Jagadeesan, and Vijay Saraswat. Computing with continuous change
– Gupta
- 1998
|
|
5
|
Interaction categories. Available by anonymous ftp from papers /Abramsky:theory.doc.ic.ac.uk
– Abramsky
- 1993
|
|
5
|
Eric Fabre, and Paul Le Guernic. A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
– Benveniste, Levy
- 1995
|
|
2
|
et al. RAPPER: The Copier Modeling Project
– Fromherz, Bell, et al.
- 1994
|
|
