CONCUR 2004 – Concurrency Theory- P18: The purpose of the CONCUR conferences is to bring together researchers, developers and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continually growing, as a consequence of the importance and ubiquity of concurrent systems and their applications, and of the scientific relevance of their foundations. | 496 D. Varacca et al. Seg95 R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis MIT 1995. Voe01 H. Volzer. 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. Var03 D. Varacca. Probability nondeterminism and Concurrency. Two denotational models for probabilistic computation. PhD thesis BRICS - Aarhus University 2003. Available at http varacca. VVW04 D. Varacca H. Volzer and G. Winskel. Probabilistic Event Structures and Domains. BRICS Technical Report RS-04-10 - Aarhus University 2004. 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. Win87 G. 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. WN95 G. Winskel and M. Nielsen. Models for concurrency. In Handbook of logic in Computer Science volume 4. Clarendon Press 1995. Appendix Domain Theory Basic Notions We briefly recall some basic notions of domain theory see . AJ94 . A directed complete partial order DCPO is a partial order where every directed set Y has a least upper bound U V. An element x of a DCPO D is compact or finite if for every directed Y and every x _ Y there exists yE Y such that x y. The set of compact elements is denoted by Cp D . A DCPO is an algebraic domain if or every x eD x is the directed least upper bound of 1 xDCp D . It is w-algebraic if Cp D is countable. In a partial order two elements are said to be compatible if they have a common upper bound. A subset of a partial order is consistent if every two of its elements are compatible. A partial order is coherent if every consistent set has a least upper bound. The Egli-Milner order on subsets of a partial order is defined by X Y if
