A fully abstract denotational model for observational precongruence

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

Authors Anna Ingolfsdottir, Andrea Schalk

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)

Recommendations

• A fully abstract denotational model for observational precongruence
• scientific article; zbMATH DE number 4199644
• Fully abstract denotational models for nonuniform concurrent languages
• Publication:4721642
• A fully abstract denotational semantics for the \(\pi\)-calculus

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• A calculus of communicating systems
• A domain equation for bisimulation
• A term model for synchronous processes
• Acceptance trees
• Algebraic semantics
• Axiomatising Finite Concurrent Processes
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• Formal verification of parallel programs
• Modal logics for communicating systems
• Termination, deadlock, and divergence

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)