Correctness of concurrent processes

DOI10.1016/0304-3975(91)90390-NzbMath0745.68045MaRDI QIDQ1176236

Ernst-Ruediger Olderog

Publication date: 25 June 1992

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

zbMATH Keywords

full abstractionreadiness semanticsProcess correctnessprocess terms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Uses Software

• COSY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• A linear-history semantics for languages for distributed programming
• Specification-oriented semantics for communicating processes
• Defining liveness
• On observational equivalence and algebraic specification
• Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
• A calculus of communicating systems
• A calculus of total correctness for communicating processes
• Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• COSY - a system specification language based on paths and processes
• Testing equivalences for processes
• Trace theory and VLSI design
• Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature
• A Theory of Communicating Sequential Processes
• Proofs of Networks of Processes
• Proving Liveness Properties of Concurrent Programs
• Some Properties of Predicate Transformers
• Programming as a Discipline of Mathematical Nature