scientific article; zbMATH DE number 7204928
From MaRDI portal
Publication:5111623
DOI10.4230/LIPIcs.CONCUR.2017.11zbMath1442.68135MaRDI QIDQ5111623
Davide Sangiorgi, Adrien Durier, Daniel Hirschkoff
Publication date: 27 May 2020
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 (5)
Eager functions as processes ⋮ Trees from Functions as Processes ⋮ Unnamed Item ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general account of coinduction up-to
- Strong normalisation in the \(\pi\)-calculus
- SOS formats and meta-theory: 20 years after
- Using bisimulation proof techniques for the analysis of distributed abstract machines
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Structured operational semantics and bisimulation as a congruence
- Understanding concurrent systems
- Equations, Contractions, and Unique Solutions
- Coalgebraic Bisimulation-Up-To
- Trees from Functions as Processes
- Termination in Impure Concurrent Languages
- A Theory of Communicating Sequential Processes
- Functions as processes
- Bisimulation can't be traced
- Coinduction All the Way Up
- Divide and Congruence II
- An Alternative Order for the Failures Model
- Theoretical Aspects of Computing – ICTAC 2005
This page was built for publication:
