Automata, Languages and Programming

DOI10.1007/11523468MaRDI QIDQ5716865zbMATH OpenOpenAlexFDO

Authors Michael Baldamus, Joachim Parrow, Björn Victor

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

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

Recommendations

• A fully abstract denotational semantics for the \(\pi\)-calculus
• A fully-abstract semantics of \(\lambda\mu\) in the \(\pi\)-calculus
• Full abstraction for polymorphic \(\pi \)-calculus
• scientific article; zbMATH DE number 1082078
• Types and full abstraction for polyadic \(\pi\)-calculus
• A symbolic semantics for the \(\pi\)-calculus
• A fully abstract model for the \(\pi\)-calculus.
• scientific article; zbMATH DE number 1759486
• Full abstraction in a subtyped pi-calculus with linear types
• Foundations of Software Science and Computational Structures

Cited in

(10)

• The attributed pi-calculus with priorities
• Weak bisimilarity coalgebraically
• Expressiveness of process algebras
• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• A complete symbolic bisimilarity for an extended spi calculus
• Replacement freeness: a criterion for separating process calculi
• Towards a unified approach to encodability and separation results for process calculi
• A taxonomy of process calculi for distribution and mobility
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• A fully abstract model for the \(\pi\)-calculus.

This page was built for publication: Automata, Languages and Programming

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