A fully abstract denotational model for observational precongruence

DOI10.1007/3-540-61377-3_47zbMATH Open1540.68125MaRDI QIDQ6560177

Andrea Schalk, Anna Ingolfsdottir

Publication date: 21 June 2024

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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