Towards a unified approach to encodability and separation results for process calculi

DOI10.1016/j.ic.2010.05.002zbMath1209.68336OpenAlexW2060992753MaRDI QIDQ1959439

Daniele Gorla

Publication date: 7 October 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.05.002

zbMATH Keywords

expressivenessprocess calculiencodings

Mathematics Subject Classification ID

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

Related Items

Session-based concurrency, declaratively, On distributability, Mixed Sessions, On the Expressiveness of Symmetric Communication, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Encodability criteria for quantum based systems, The true concurrency of differential interaction nets, Comparing type systems for deadlock freedom, Unnamed Item, Coupled similarity: the first 32 years, Reactive Turing machines, Unnamed Item, Non-Deterministic Functions as Non-Deterministic Processes (Extended Version), Expressiveness of concurrent intensionality, The reflective higher-order calculus: encodability, typability and separation, Comparing the expressiveness of the \(\pi \)-calculus and CCS, Psi-calculi revisited: connectivity and compositionality, Unnamed Item, Expressiveness modulo bisimilarity of regular expressions with parallel composition, Breaking symmetries, Synchrony versus causality in distributed systems, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Observing Success in the Pi-Calculus, Unnamed Item, Distributability of mobile ambients, Expressiveness of component-based frameworks: a study of the expressiveness of BIP, Unnamed Item, Unnamed Item, Unnamed Item, A taxonomy of process calculi for distribution and mobility, The \(C_\pi\)-calculus: a model for confidential name passing, Full abstraction for expressiveness: history, myths and facts, Ensuring liveness properties of distributed systems: open problems, On the relative expressiveness of higher-order session processes, A calculus for collective-adaptive systems and its behavioural theory, On the Relative Expressiveness of Higher-Order Session Processes, A calculus of concurrent graph-rewriting processes, On primitives for compensation handling as adaptable processes, Unnamed Item, Mixed sessions, Unnamed Item, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, On constructibility and unconstructibility of LTS operators from other LTS operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation for higher-order process calculi
• Comparing communication primitives via their relative expressive power
• A calculus of mobile processes. II
• On the expressiveness of internal mobility in name-passing calculi
• 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
• A structural approach to operational semantics
• Types and full abstraction for polyadic \(\pi\)-calculus
• Separation of synchronous and asynchronous communication via testing
• Symmetric electoral systems for ambient calculi
• 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
• Behavioral theory for mobile ambients
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• Functions as processes
• Automata, Languages and Programming
• 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