About: Power domains

An Entity of Type: protein, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations. The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set-valued function, where the set contains all values the nondeterministic function can take for a given argument. For concurrent systems, the idea is to express the set of all possible computations. A modern reference to this subject is the chapter of Abramsky and Jung [1994]. Older references include those of Plotkin [1983, Chapter 8] and Smyth [1978].

Property Value
dbo:abstract
  • In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations. The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set-valued function, where the set contains all values the nondeterministic function can take for a given argument. For concurrent systems, the idea is to express the set of all possible computations. Roughly speaking, a power domain is a domain whose elements are certain subsets of a domain. Taking this approach naively, though, often gives rise to domains that don't quite have the desired properties, and so one is led to increasingly complicated notions of power domain. There are three common variants: the Plotkin, upper, and lower power domains. One way to understand these concepts is as free models of theories of nondeterminism. For most of this article we use the terms "domain" and "continuous function" quite loosely, meaning respectively some kind of ordered structure and some kind of limit-preserving function. This flexibility is genuine; for example, in some concurrent systems it is natural to impose the condition that every message sent must eventually be delivered. However, the limit of a chain of approximations in which a message was not delivered, would be a completed computation in which the message was never delivered! A modern reference to this subject is the chapter of Abramsky and Jung [1994]. Older references include those of Plotkin [1983, Chapter 8] and Smyth [1978]. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 2676589 (xsd:integer)
dbo:wikiPageLength
  • 9133 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1060156011 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations. The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set-valued function, where the set contains all values the nondeterministic function can take for a given argument. For concurrent systems, the idea is to express the set of all possible computations. A modern reference to this subject is the chapter of Abramsky and Jung [1994]. Older references include those of Plotkin [1983, Chapter 8] and Smyth [1978]. (en)
rdfs:label
  • Power domains (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License