A continuous semantics for unbounded nondeterminism

DOI10.1016/0304-3975(83)90055-5MaRDI QIDQ1171370zbMATH OpenOpenAlexWikidataFDO

Authors Ralph-Johan Back

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90055-5

zbMATH Keywords

operational semanticsdenotational semantic for programming languagesiterative programming languageprogram execution trees

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 3658971 (Why is no real title available?)
• scientific article; zbMATH DE number 3705887 (Why is no real title available?)
• scientific article; zbMATH DE number 3707731 (Why is no real title available?)
• scientific article; zbMATH DE number 3714908 (Why is no real title available?)
• scientific article; zbMATH DE number 3729429 (Why is no real title available?)
• scientific article; zbMATH DE number 3574942 (Why is no real title available?)
• scientific article; zbMATH DE number 3621081 (Why is no real title available?)
• scientific article; zbMATH DE number 3630737 (Why is no real title available?)
• scientific article; zbMATH DE number 3635472 (Why is no real title available?)
• A Powerdomain Construction
• A continuous semantics for unbounded nondeterminism
• Initial Algebra Semantics and Continuous Algebras
• Programming as a Discipline of Mathematical Nature
• Proving total correctness of nondeterministic programs in infinitary logic
• Semantics of nondeterminism, concurrency, and communication

Cited in

(9)

• Nondeterministic semantics of compound diagrams
• Applications of compactness in the Smyth powerdomain of streams
• Hiding in stream semantics of uniform concurrency
• Merging regular processes by means of fixed-point theory
• A continuous semantics for unbounded nondeterminism
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Step semantics for ``true concurrency with recursion
• Nonexpressibility of fairness and signaling
• Infinite streams and finite observations in the semantics of uniform concurrency

This page was built for publication: A continuous semantics for unbounded nondeterminism

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