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)

Recommendations

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

zbMATH Keywords

CSP operator

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Unbounded Non-determinism in CSP
• The fixed point theory of unbounded non-determinism
• Recursion induction for real-time processes
• Full abstraction and recursion
• An application of lattice theory to knowledge representation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unbounded nondeterminism in CSP

Cited In (4)

• The timed failures -- Stability model for CSP
• The fixed point theory of unbounded non-determinism
• Incompleteness and fixed points
• 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)