Skip to search formSkip to main contentSkip to account menu

Power domains

Known as: History of power domains, Power domain, Powerdomain 
In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations. The idea of power domains for… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Actor modelActor model theoryCommunications of the ACMConcurrency (computer science)

Broader (1)

Denotational semantics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Prüfer domains with Clifford class semigroup
Bazzoni’s Conjecture states that the Prüfer domain R has finite character if and only if R has the property that an ideal of R is… 
2009
2009
Three scalable approaches to improving many-core throughput for a given peak power budget
Recently proposed techniques for peak power management [18] involve centralized decision-making and assume quick evaluation of… 
2004
2004
Semantics of a sequential language for exact real-number computation
2003
2003
A new parallel overlapped domain decomposition method for nonlinear dynamic finite element analysis
2002
2002
Clausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a… 
2001
2001
Bond Graph Modeling Procedures for Fault Detection and Isolation of Complex Flow Processes
Many models for fault detection and isolation (FDI) will contain multi-port energy storage and flow-dependencies due to… 
1993
1993
Call-by-Value and Nondeterminism
We consider the three classical powerdomain semantics (lower, upper and convex) for PCFnv, a nondeterministic call-by-value… 
1991
1991
A CTASS OF MEROMORPHIC FUNCTIONS \MITH NO WANDERING DOMAINS
We consider the class of meromorphic functions with finitely many fixed points, that is the class offunctions ofthe form f(z) = z… 
1989
1989
On the relations computable by a class of concurrent automata
We consider <italic>monotone input/output automata</italic>, which model a usefully large class of dataflow networks of… 
1983
1983
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)