Analysing and comparing encodability criteria

zbMATH Open1476.68181arXiv1508.06711MaRDI QIDQ5013871FDOQ5013871

Authors: Kirstin Peters, Rob van Glabbeek 

Publication date: 3 December 2021

Full work available at URL: https://arxiv.org/abs/1508.06711

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 \(\pi\)-calculus
• Encodability criteria for quantum based systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• Title not available (Why is that?)
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• The \(C_\pi\)-calculus: a model for confidential name passing
• 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 \(\pi\)-calculus
• Encoding CSP into CCS
• Characterizing contrasimilarity through games, modal logic, and complexity
• A theory of encodings and expressiveness (extended abstract)
• 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

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)