Probabilistic event structures and domains

Theoretical Computer Science

Volumn 358, Issue 2-3, 2006, Pages 173-199

  Varacca, Daniele ^a   Völzer, Hagen ^b   Winskel, Glynn ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF LÜBECK   (Germany)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Causality; Concurrency; Domain theory; Event structures; Probability

Indexed keywords

CONCURRENCY CONTROL; CORRELATION METHODS; DATA STRUCTURES; INCLUSIONS; PROBABILITY; THEOREM PROVING; TIME DOMAIN ANALYSIS;

CAUSALITY; CONCURRENCY; DOMAIN THEORY; EVENT STRUCTURES;

PROBABILISTIC LOGICS;

EID: 33746286688     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.015     Document Type: Article

References (24)

1. S. Abbes, Probabilistic models for distributed and concurrent systems. Limit theorems and applications to statistical parameter estimation, Ph.D. Thesis, IRISA, University of Rennes, 2004.
2. S. Abramsky, A. Jung, Domain theory, in: Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, Oxford, 1994.
3. M. Alvarez-Manilla, Measure theoretic results for continuous valuations on partially ordered spaces, Ph.D. Thesis, University of London, Imperial College of Science, Technology and Medicine, 2000.
4. Alvarez-Manilla M., Edalat A., and Saheb-Djaromi N. An extension result for continuous valuations. J. London Math. Soc. 61 2 (2000) 629-640
5. Benveniste A., Fabre E., and Haar S. Markov nets: probabilistic models for distributed and concurrent systems. IEEE Trans. Automat. Control 48 11 (2003) 1936-1950
6. L. de Alfaro, T.A. Henzinger, R. Jhala, Compositional methods for probabilistic systems, in: Proc. 12th CONCUR, Lecture Notes in Computer Science, Vol. 2154, Springer, Berlin, 2001, pp. 351-365.
7. Desharnais J., Edalat A., and Panangaden P. Bisimulation for labelled markov processes. Inform. and Comput. 179 2 (2002) 163-193
8. Edalat A. Domain theory and integration. Theoret. Comput. Sci. 151 1 (1995) 163-193
9. P. Halmos, Measure Theory, van Nostrand, Princeton, NJ, 1950. New edition, Springer, Berlin, 1974.
10. Jones C., and Plotkin G.D. A probabilistic powerdomain of evaluations. Proc. 4th LICS (1989) 186-195
11. Kahn G., and Plotkin G.D. Concrete domains. Theoret. Comput. Sci. 121 1-2 (1993) 187-277
12. J.-P. Katoen, Quantitative and qualitative extensions of event structures, Ph.D. Thesis, University of Twente, 1996.
13. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94 1 (1991) 1-28
14. Lawson J.D. Spaces of maximal points. Math. Struct. Comput. Sci. 7 5 (1997) 543-555
15. Lawson J.D. Computation on metric spaces via domain theory. Topology Appl. 85 (1998) 247-263
16. Milner R. Communication and Concurrency (1989), Prentice-Hall, Englewood Cliffs, NJ
17. Nielsen M., Plotkin G.D., and Winskel G. Petri nets, event structures and domains, part I. Theoret. Comput. Sci. 13 1 (1981) 85-108
18. G. Rozenberg, J. Engelfriet, Elementary net systems, in: Dagstuhl Lectures on Petri Nets, Lecture Notes in Computer Science, Vol. 1491, Springer, Berlin, 1996, pp. 12-121.
19. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, MIT, 1995.
20. D. Varacca, Probability, nondeterminism and concurrency. Two denotational models for probabilistic computation, Ph.D. Thesis, BRICS, Aarhus University, 2003. Available at 〈http://www.brics.dk/∼varacca〉.
21. D. Varacca, H. Völzer, G. Winskel, Probabilistic event structures and domains, in: Proc. 15th CONCUR, Lecture Notes in Computer Science, Vol. 3170, Springer, Berlin, 2004, pp. 481-496.
22. H. Völzer, Randomized non-sequential processes, in: Proc. 12th CONCUR, Lecture Notes in Computer Science, Vol. 2154, 2001, pp. 184-201. Extended version as Technical Report 02-28, SVRC, University of Queensland.
23. G. Winskel, Event structure semantics for CCS and related languages, in: Proc. 9th ICALP, Lecture Notes in Computer Science, Vol. 140, Springer, Berlin, 1982, pp. 561-576.
24. Winskel G., and Nielsen M. Models for concurrency. Handbook of Logic in Computer Science Vol. 4 (1995), Clarendon Press, Oxford