scientific article; zbMATH DE number 3806938

MaRDI QIDQ4749207zbMATH OpenFDO

Authors Gordon D. Plotkin

Publication date 1982

zbMATH Keywords

fairness of processesnondeterminismpowerdomainstheory of computing

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of computing (68Q99)

Cited in

(25)

• Domain semantics of possibility computations
• On powerdomains and modality
• Structured algebraic specifications: A kernel language
• Continuous semilattices
• Deadlock and fairness in morphisms of transition systems
• Domain theory in logical form
• An extensional fixed-point semantics for nondeterministic data flow
• The expressive power of indeterminate dataflow primitives
• Synchronization trees
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Weak and strong fairness in CCS
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Keep it fair: equivalence and composition
• The symmetric monoidal closed category of cpo M-sets
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• Probabilistic completion of nondeterministic models
• SOS rule formats for zero and unit elements
• A -denotational semantics for map theory in ZFC+SI
• A fully abstract denotational semantics for the calculus of higher-order communicating systems
• Scott topology on Smyth power posets
• Duality beyond sober spaces: Topological spaces and observation frames
• Separately continuous algebras
• A fair calculus of communicating systems
• Fairness and conspiracies

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749207)