Characteristic bisimulation for higher-order session processes
From MaRDI portal
Publication:2357655
DOI10.1007/s00236-016-0289-7zbMath1380.68297OpenAlexW2761131108WikidataQ57652334 ScholiaQ57652334MaRDI QIDQ2357655
Dimitrios Kouzapas, Nobuko Yoshida, Jorge A. Pérez
Publication date: 14 June 2017
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-016-0289-7
transition systemcontextual equivalencehigher-order \(\pi\)-calculuscharacteristic bisimilaritycharacteristic bisimulationcontext bisimilarityhigher-order bisimilarity
Related Items (4)
Minimal session types for the \(\pi\)-calculus ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ On the relative expressiveness of higher-order session processes ⋮ On the Relative Expressiveness of Higher-Order Session Processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order reasoning for higher-order concurrency
- Linear logical relations and observational equivalences for session-based concurrency
- Strong normalisation in the \(\pi\)-calculus
- On the expressiveness and decidability of higher-order process calculi
- Confluence for process verification
- Bisimulation for higher-order process calculi
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Plain CHOCS. A second generation calculus for higher order processes
- On reduction-based process semantics
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Genericity and the \(\pi\)-calculus
- On the Relative Expressiveness of Higher-Order Session Processes
- On Duality Relations for Session Types
- A Distributed Pi-Calculus
- Logical Bisimulations and Functional Languages
- Two Session Typing Systems for Higher-Order Mobile Processes
- Functions as processes
- A uniform type structure for secure information flow
- Linear type theory for asynchronous session types
- Barbed bisimulation
- Contextual equivalence for higher-order pi-calculus revisited
- Howe's Method for Contextual Semantics
- On asynchronous eventful session semantics
- Globally Governed Session Semantics
This page was built for publication: Characteristic bisimulation for higher-order session processes