On the relationships between Scott domains, synchronization trees, and metric spaces

DOI10.1016/S0019-9958(85)80009-7zbMath0598.68014OpenAlexW2000059452MaRDI QIDQ3732940

William C. Rounds

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(85)80009-7

zbMATH Keywords

denotational semanticscomplete partial order semantics for concurrencycpo continuity

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (4)

Algebraic solutions to recursion schemes ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Trees and semantics ⋮ Underspecification for a simple process algebra of recursive processes.

This page was built for publication: On the relationships between Scott domains, synchronization trees, and metric spaces