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

DOI10.1007/978-3-540-85361-9_38MaRDI QIDQ3541040zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Towards a unified approach to encodability and separation results for process calculi
• Analysing and comparing encodability criteria
• A criterion for separating process calculi
• Replacement freeness: a criterion for separating process calculi
• On the validity of encodings of the synchronous in the asynchronous -calculus

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2059568 (Why is no real title available?)
• A typed encoding of boxed into safe ambients
• An efficiency preorder for processes
• Automata, Languages and Programming
• Barbed bisimulation
• Decoding choice encodings
• Embedding as a tool for language comparison
• Expressiveness of process algebras
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computation Structures
• Functions as processes
• Leader election in rings of ambient processes
• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• Matching systems for concurrent calculi
• Mobile ambients
• On bisimulations for the asynchronous -calculus
• On reduction-based process semantics
• On the relative expressive power of calculi for mobility
• Resource access control in systems of mobile agents
• Secure implementations of typed channel abstractions
• Semantic Barbs and Biorthogonality
• Separation of synchronous and asynchronous communication via testing
• Synchrony vs asynchrony in communication primitives
• Testing equivalences for processes
• The -calculus: A theory of mobile processes
• Types for the ambient calculus
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• What is a ``good encoding of guarded choice?

Cited in

(19)

• Probabilistic operational correspondence
• On the relative expressive power of calculi for mobility
• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• On the expressiveness of interaction
• The expressive power of monotonic parallel composition
• Parameterizing higher-order processes on names and processes
• Translation of CCS into CSP, correct up to strong bisimulation
• Towards a unified approach to encodability and separation results for process calculi
• On the interactive power of higher-order processes extended with parameterization
• Analysing and comparing encodability criteria
• Concurrency cannot be observed, asynchronously
• Replacement freeness: a criterion for separating process calculi
• A thesis for interaction
• Distinguishing and relating higher-order and first-order processes by expressiveness
• scientific article; zbMATH DE number 7204939 (Why is no real title available?)
• Decidable fragments of a higher order calculus with locations
• Higher-order processes with parameterization over names and processes
• A criterion for separating process calculi
• Theory of interaction

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

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