Fixed points without completeness

DOI10.1016/0304-3975(94)00170-NzbMATH Open0874.68186DBLPjournals/tcs/MisloveRS95WikidataQ60173630 ScholiaQ60173630MaRDI QIDQ674192FDOQ674192

Authors A. W. Roscoe, Michael Mislove, S. A. Schneider

Publication date 28 February 1997

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

zbMATH Keywords

CSP operator

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• The fixed point theory of unbounded non-determinism
• Unbounded Non-determinism in CSP
• Unbounded nondeterminism in CSP
• scientific article; zbMATH DE number 4050970

Cites work

• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 3956423 (Why is no real title available?)
• scientific article; zbMATH DE number 4050970 (Why is no real title available?)
• An application of lattice theory to knowledge representation
• Full abstraction and recursion
• Recursion induction for real-time processes
• The fixed point theory of unbounded non-determinism
• Unbounded Non-determinism in CSP
• Unbounded nondeterminism in CSP

Cited in

(4)

• The timed failures -- Stability model for CSP
• Incompleteness and fixed points
• The fixed point theory of unbounded non-determinism
• Communicating Sequential Processes. The First 25 Years

This page was built for publication: Fixed points without completeness

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