Semantics of nondeterminism, concurrency, and communication

DOI10.1016/0022-0000(79)90006-0MaRDI QIDQ1139946zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1979

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/15886

zbMATH Keywords

fixed pointsconcurrent programmingdomain equationbinding terminationdenotational semantics for a high level language for distributed programming

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3653565 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• scientific article; zbMATH DE number 3495581 (Why is no real title available?)
• scientific article; zbMATH DE number 3532506 (Why is no real title available?)
• scientific article; zbMATH DE number 3551848 (Why is no real title available?)
• scientific article; zbMATH DE number 3581594 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• A Powerdomain Construction
• A Proof System for Communicating Sequential Processes
• An axiomatic proof technique for parallel programs
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Monitors
• Power domains
• Programming as a Discipline of Mathematical Nature

Cited in

(27)

• On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• Towards a foundation for semantics in complete metric spaces
• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
• Semantics of production systems
• Denotational semantics of CSP
• Contractions in comparing concurrency semantics
• Merging regular processes by means of fixed-point theory
• A continuous semantics for unbounded nondeterminism
• In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
• A compositional proof system for distributed programs
• A denotational semantics for shared-memory parallelism and nondeterminism
• Step failures semantics and a complete proof system
• Latent semantic analysis of game models using LSTM
• A linear-history semantics for languages for distributed programming
• Communication in concurrent dynamic logic
• Composition of synchronous communicating systems
• Testing equivalences for processes
• Semantics of algorithmic languages
• Systemic computation: A model of interacting systems with natural characteristics
• Step semantics for ``true concurrency with recursion
• A Bibliography of Willem-Paul de Roever
• A weakest precondition semantics for communicating processes
• Specification-oriented semantics for communicating processes
• Infinite streams and finite observations in the semantics of uniform concurrency
• Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
• The epistemology of nondeterminism

This page was built for publication: Semantics of nondeterminism, concurrency, and communication

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