A fully abstract denotational model for observational precongruence

DOI10.1016/S0304-3975(99)00117-6zbMath0972.68121MaRDI QIDQ5940916

No author found.

Publication date: 20 August 2001

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

zbMATH Keywords

bisimulationdenotational modelfull abstraction

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Algebraic semantics
• A domain equation for bisimulation
• Acceptance trees
• Axiomatising Finite Concurrent Processes
• A term model for synchronous processes
• Formal verification of parallel programs
• Termination, deadlock, and divergence