A fully abstract denotational model for observational precongruence
From MaRDI portal
Publication:5940916
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)
Related Items (2)
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
This page was built for publication: A fully abstract denotational model for observational precongruence