Probabilistic event structures and domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3170, Issue , 2004, Pages 481-496

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

^a LIENS École Normale Supérieure   (France)

^b UNIVERSITY OF LÜBECK   (Germany)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CAUSAL INDEPENDENCE; CONTINUOUS VALUATIONS; DOMAIN THEORY; EVENT STRUCTURES; IT SUPPORTS; PROBABILISTIC CHOICES; PROBABILISTIC PROCESS; REPRESENTATION THEOREM;

SEMANTICS;

EID: 35048824804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_31     Document Type: Article

References (20)

1. [AJ94] S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, volume 3. Clarendon Press, 1994.
2. [Alv00] M. Alvarez-Manilla. Measure Theoretic Results for Continuous Valuations on Partially Ordered Spaces. PhD thesis, University of London - Imperial College of Science, Technology and Medicine, 2000.
3. [AES00] M. Alvarez-Manilla, A. Edalat, and N. Saheb-Djaromi. An extension result for continuous valuations. Journal of the London Mathematical Society, 61(2):629-640, 2000.
4. [BFH03] A. Benveniste, E. Fabre, and S. Haar. Markov nets: Probabilistic models for distributed and concurrent systems. IEEE Transactions on Automatic Control, 48(11):1936-1950, 2003.
5. [dAHJ01] L. de Alfaro, T. A. Henzinger, and R. Jhala. Compositional methods for probabilistic systems. In Proc. 12th CONCUR, volume 2154 of LNCS, pages 351-365, 2001.
6. [DEP02] J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled markov processes. Information and Computation, 179(2):163-193, 2002.
7. [Eda95] A. Edalat. Domain theory and integration. Theoretical Computer Science, 151(1):163-193, 13 November 1995.
8. [JP89] C. Jones and G. D. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings of 4th LICS, pages 186-195, 1989.
9. [Kat96] J.-P. Katoen. Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente, 1996.
10. [KP93] G. Kahn and G. D. Plotkin. Concrete domains. Theoretical Computer Science, 121(1-2):187-277, 1993.
11. [LS91] K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
12. [Mil89] R. Milner. Communication and Concurrency. Prentice Hall, 1989.
13. [NPW81] M. Nielsen, G. D. Plotkin, and G. Winskel. Petri nets, event structures and domains, part I. Theoretical Computer Science, 13(1):85-108, 1981.
14. [Seg95] R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
15. [Voe01] H. Völzer. Randomized non-sequential processes. In Proceedings of 12th CONCUR, volume 2154 of LNCS, pages 184-201, 2001. Extended version as Technical Report 02-28 - SVRC - University of Queensland.
16. [Var03] D. Varacca. Probability, nondeterminism and Concurrency. Two denotational models for probabilistic computation. PhD thesis, BRIGS - Aarhus University, 2003. Available at http://www.brics.dk/~varacca.
17. [VVW04] D. Varacca, H. Völzer and G. Winskel. Probabilistic Event Structures and Domains. BRICS Technical Report RS-04-10 - Aarhus University, 2004.
18. [Win82] G. Winskel. Event structure semantics for CCS and related languages. In Proceedings of 9th ICALP, volume 140 of LNCS, pages 561-576. Springer, 1982.
19. [Win87] C. Winskel. Event structures. In Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course, Bad Honnef, September 1986, volume 255 of LNCS, pages 325-392. Springer, 1987.
20. [WN95] G. Winskel and M. Nielsen. Models for concurrency. In Handbook of logic in Computer Science, volume 4. Clarendon Press, 1995.