Fixed points without completeness

DOI10.1016/0304-3975(94)00170-NzbMath0874.68186WikidataQ60173630 ScholiaQ60173630MaRDI QIDQ674192

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

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)

Related Items

The timed failures -- Stability model for CSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Unbounded Non-determinism in CSP
• Unbounded nondeterminism in CSP

This page was built for publication: Fixed points without completeness