On the public citation graph

A powerdomain for countable non-determinism

https://doi.org/10.1007/bfb0012788
0 signed · 69 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bfb0022459openalex-snapshot
Semantics of Concurrent Computation
inferredcites →https://doi.org/10.1007/bfb0025770openalex-snapshot
Proof rules dealing with fairness
inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot
Power domains
inferredcites →https://doi.org/10.1016/0022-0000(79)90026-6openalex-snapshot
Least fixed point of a functor
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_131openalex-snapshot
A note on powerdomains and modality
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_96openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_352openalex-snapshot
Compactness in semantics for merge and fair merge
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_382openalex-snapshot
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_3openalex-snapshot
The theory of strictness analysis for higher order functions
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_11openalex-snapshot
Defining Fair Merge as a Colimit: Towards a Fixed-Point Theory for Indeterminate Dataflow
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_12openalex-snapshot
Countable Non-Determinism and Uncountable Limits
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_12openalex-snapshot
A Rule Format for Unit Elements
inferred← citeshttps://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferred← citeshttps://doi.org/10.1007/bf00271640openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/bf01887206openalex-snapshot
Event fairness and non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/bfb0015004openalex-snapshot
Countable non-determinism and uncountable limits
inferred← citeshttps://doi.org/10.1007/bfb0022270openalex-snapshot
Powerdomains, powerstructures and fairness
inferred← citeshttps://doi.org/10.1007/bfb0028816openalex-snapshot
Recent results on continuous ordered algebras
inferred← citeshttps://doi.org/10.1007/bfb0036897openalex-snapshot
Processes and a fair semantics for the ADA rendez-vous
inferred← citeshttps://doi.org/10.1007/bfb0036935openalex-snapshot
Strong abstract interpretation using power domains
inferred← citeshttps://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferred← citeshttps://doi.org/10.1007/bfb0053538openalex-snapshot
Generalizing domain theory
inferred← citeshttps://doi.org/10.1007/s00236-015-0221-6openalex-snapshot
CCS: It’s not fair!
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90114-5openalex-snapshot
Fairness and conspiracies
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90010-9openalex-snapshot
Strictness analysis for higher-order functions
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90102-0openalex-snapshot
Separately continuous algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90112-9openalex-snapshot
Synchronization trees
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90037-4openalex-snapshot
On powerdomains and modality
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00048-2openalex-snapshot
Duality beyond sober spaces: Topological spaces and observation frames
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50016-0openalex-snapshot
Denotational Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.063openalex-snapshot
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.028openalex-snapshot
Probabilistic Completion of Nondeterministic Models
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.01.002openalex-snapshot
Semantic Domains for Combining Probability and Non-Determinism
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.009openalex-snapshot
On Rule Formats for Zero and Unit Elements
inferred← citeshttps://doi.org/10.1016/j.ins.2008.01.016openalex-snapshot
Domain semantics of possibility computations
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.004openalex-snapshot
Keep it fair: Equivalence and composition
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.024openalex-snapshot
SOS rule formats for zero and unit elements
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00281-4openalex-snapshot
A fully abstract denotational semantics for the calculus of higher-order communicating systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00247-xopenalex-snapshot
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80007-0openalex-snapshot
Domain Theory in Learning Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80311-1openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
inferred← citeshttps://doi.org/10.1017/s0960129502003778openalex-snapshot
βη-complete models for System F
inferred← citeshttps://doi.org/10.1017/s0960129523000257openalex-snapshot
Scott topology on Smyth power posets
inferred← citeshttps://doi.org/10.1109/lics.1998.705658openalex-snapshot
A theory of recursive domains with applications to concurrency
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00015openalex-snapshot
Closure and Complexity of Temporal Causality
inferred← citeshttps://doi.org/10.1145/800017.800536openalex-snapshot
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
inferred← citeshttps://doi.org/10.1145/800057.808662openalex-snapshot
Modelling fair processes
inferred← citeshttps://doi.org/10.1145/800057.808663openalex-snapshot
Liveness properties as convergence in metric spaces
inferred← citeshttps://doi.org/10.22111/ijfs.2015.2184openalex-snapshot
A generalization of the Chen-Wu duality into quantale-valued setting
inferred← citeshttps://doi.org/10.29252/cgasa.13.1.105openalex-snapshot
The symmetric monoidal closed category of cpo M -sets
inferred← citeshttps://doi.org/10.3233/fi-1995-2236openalex-snapshot
FAIRNESS AND PRIORITY
inferred← citeshttps://doi.org/10.4204/eptcs.261.4openalex-snapshot
Keep it Fair: Equivalences
inferred← citeshttps://doi.org/10.4230/lipics.itp.2019.31openalex-snapshot
Domain Theory and the Logic of Observable Properties
inferred← citeshttps://doi.org/10.46298/lmcs-17(4:11)2021openalex-snapshot
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism
inferred← citeshttps://doi.org/10.7146/brics.v4i35.18961openalex-snapshot
A Theory of Recursive Domains with Applications to Concurrency
inferred← citeshttps://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
inferred← citeshttps://doi.org/10.7146/dpb.v18i276.7630openalex-snapshot
Semantic Domains and Denotational Semantics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.