scientific article
From MaRDI portal
Publication:3385647
Publication date: 20 December 2021
Full work available at URL: https://arxiv.org/abs/1908.08633
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
Session-based concurrency, declaratively ⋮ Encodability criteria for quantum based systems ⋮ Translation of CCS into CSP, correct up to strong bisimulation ⋮ On the Introduction of Guarded Lists in Bach: Expressiveness, Correctness, and Efficiency Issues ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On primitives for compensation handling as adaptable processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A taxonomy of process calculi for distribution and mobility
- Theory of interaction
- On the expressiveness of interaction
- A calculus of mobile processes. I
- An efficiency preorder for processes
- On abstraction and the expressive power of programming languages
- On reduction-based process semantics
- A theory of encodings and expressiveness (extended abstract)
- A brief history of process algebra
- What is a ``good encoding of guarded choice?
- Decoding choice encodings
- Towards a unified approach to encodability and separation results for process calculi
- Tutorial on separation results in process calculi via leader election problems
- On the Relative Expressive Power of Calculi for Mobility
- On the Expressive Power of Polyadic Synchronisation in π-calculus
- Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
- Expressiveness of Process Algebras
- Is It a “Good” Encoding of Mixed Choice?
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- On the expressive power of recursion, replication and iteration in process calculi
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- Functions as processes
- Communicating sequential processes
- Barbed bisimulation
- On Distributability in Process Calculi
- Automata, Languages and Programming
- Full abstraction for expressiveness: history, myths and facts
- General conditions for full abstraction
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- An investigation into functions as processes
- Constraints as processes
This page was built for publication: