Analysing and comparing encodability criteria

MaRDI QIDQ5013871zbMATH OpenFDO

Authors Kirstin Peters, Rob van Glabbeek

Publication date 3 December 2021

Full work available at URL https://arxiv.org/abs/1508.06711, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2015.4

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
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• A criterion for separating process calculi
• On the validity of encodings of the synchronous in the asynchronous -calculus
• Encodability criteria for quantum based systems

Cites work

• A calculus of mobile processes. I
• Decoding choice encodings
• Encoding CSP into CCS
• Expressiveness of process algebras
• Full abstraction for expressiveness: history, myths and facts
• General conditions for full abstraction
• Is it a ``good encoding of mixed choice?
• Isabelle/HOL. A proof assistant for higher-order logic
• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• Mobile ambients
• Musings on encodings and expressiveness
• On abstraction and the expressive power of programming languages
• On distributability in process calculi
• On the expressive power of recursion, replication and iteration in process calculi
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Towards a unified approach to encodability and separation results for process calculi
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• What is a ``good encoding of guarded choice?

Cited in

(20)

• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• The \(C_\pi\)-calculus: a model for confidential name passing
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• On distributability
• Encodability criteria for quantum based systems
• Towards a unified approach to encodability and separation results for process calculi
• On the validity of encodings of the synchronous in the asynchronous -calculus
• A theory of encodings and expressiveness (extended abstract)
• Encoding CSP into CCS
• Characterizing contrasimilarity through games, modal logic, and complexity
• A game characterization for contrasimilarity
• Coupled similarity: the first 32 years
• Replacement freeness: a criterion for separating process calculi
• Encodability criteria for quantum based systems
• On the relative expressiveness of higher-order session processes
• On the expressiveness of mixed choice sessions
• Musings on encodings and expressiveness
• Distributability of mobile ambients
• A criterion for separating process calculi
• Mixed choice in session types

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: Analysing and comparing encodability criteria

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