Towards a Unified Approach to Encodability and Separation Results for Process Calculi

DOI10.1007/978-3-540-85361-9_38zbMath1160.68466OpenAlexW1521604752MaRDI QIDQ3541040

Daniele Gorla

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_38

Mathematics Subject Classification ID

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

Related Items (15)

Translation of CCS into CSP, correct up to strong bisimulation ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ On the expressiveness of interaction ⋮ Decidable Fragments of a Higher Order Calculus with Locations ⋮ Concurrency cannot be observed, asynchronously ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ On the Relative Expressive Power of Calculi for Mobility ⋮ Unnamed Item ⋮ A thesis for interaction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On bisimulations for the asynchronous \(\pi\)-calculus
• Embedding as a tool for language comparison
• An efficiency preorder for processes
• Testing equivalences for processes
• On reduction-based process semantics
• Mobile ambients
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Resource access control in systems of mobile agents
• Separation of synchronous and asynchronous communication via testing
• A typed encoding of boxed into safe ambients
• Leader election in rings of ambient processes
• Types for the ambient calculus
• On the Relative Expressive Power of Calculi for Mobility
• Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
• Matching Systems for Concurrent Calculi
• Synchrony vs Asynchrony in Communication Primitives
• Expressiveness of Process Algebras
• Secure implementations of typed channel abstractions
• Functions as processes
• Barbed bisimulation
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• Semantic Barbs and Biorthogonality
• Foundations of Software Science and Computation Structures

This page was built for publication: Towards a Unified Approach to Encodability and Separation Results for Process Calculi