A fully abstract denotational model for observational precongruence

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• A domain equation for bisimulation
• Title not available (Why is that?)
• A term model for synchronous processes
• Formal verification of parallel programs
• Termination, deadlock, and divergence
• Bisimulation and divergence
• Title not available (Why is that?)
• Acceptance trees
• Axiomatising Finite Concurrent Processes
• Algebraic semantics
• Modal logics for communicating systems

This page was built for publication: A fully abstract denotational model for observational precongruence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560177)