Automata, Languages and Programming

DOI10.1007/11523468zbMATH Open1085.68594OpenAlexW2940595899MaRDI QIDQ5716865FDOQ5716865

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

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

Mathematics Subject Classification ID

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

Cited In (10)

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

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)