Comparing process calculi using encodings
From MaRDI portal
Recommendations
- Analysing and comparing encodability criteria
- Towards a unified approach to encodability and separation results for process calculi
- 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 criterion for separating process calculi
Cites work
- A brief history of process algebra
- A calculus of mobile processes. I
- A taxonomy of process calculi for distribution and mobility
- A theory of encodings and expressiveness (extended abstract)
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- An efficiency preorder for processes
- An investigation into functions as processes
- Analysing and comparing encodability criteria
- Automata, Languages and Programming
- Barbed bisimulation
- Communicating sequential processes
- Constraints as processes
- Decoding choice encodings
- Encoding CSP into CCS
- Expressiveness of process algebras
- Full abstraction for expressiveness: history, myths and facts
- Functions as processes
- General conditions for full abstraction
- scientific article; zbMATH DE number 3876566 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- Is it a ``good encoding of mixed choice?
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- Musings on encodings and expressiveness
- On abstraction and the expressive power of programming languages
- On distributability in process calculi
- On reduction-based process semantics
- On the expressive power of polyadic synchronisation in -calculus
- On the expressive power of recursion, replication and iteration in process calculi
- On the expressiveness of interaction
- On the relative expressive power of calculi for mobility
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Theory of interaction
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Towards a unified approach to encodability and separation results for process calculi
- Tutorial on separation results in process calculi via leader election problems
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- What is a ``good encoding of guarded choice?
Cited in
(16)- On primitives for compensation handling as adaptable processes
- Session-based concurrency, declaratively
- Encodability criteria for quantum based systems
- scientific article; zbMATH DE number 7453959 (Why is no real title available?)
- Translation of CCS into CSP, correct up to strong bisimulation
- From CCS to CSP: the m-among-n synchronisation approach
- On the expressiveness of mixed choice sessions
- On the Introduction of Guarded Lists in Bach: Expressiveness, Correctness, and Efficiency Issues
- Mixed choice in session types
- Encodability criteria for quantum based systems
- Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
- Comparing session type systems derived from linear logic
- On the expressiveness and efficiency of guarded lists in Bach
- Typed non-determinism in concurrent calculi: the eager way
- Probabilistic operational correspondence
- Separation and encodability in mixed choice multiparty sessions
This page was built for publication: Comparing process calculi using encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385647)
