scientific article; zbMATH DE number 7093559
From MaRDI portal
Publication:5228882
zbMath1442.68134arXiv1806.11354MaRDI QIDQ5228882
Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
Publication date: 13 August 2019
Full work available at URL: https://arxiv.org/abs/1806.11354
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 (3)
Unnamed Item ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Towards `up to context' reasoning about higher-order processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Structured operational semantics and bisimulation as a congruence
- Understanding concurrent systems
- Ensuring termination by typability
- Equations, Contractions, and Unique Solutions
- Coalgebraic Bisimulation-Up-To
- Termination in Impure Concurrent Languages
- A Theory of Communicating Sequential Processes
- Process Algebra
- Functions as processes
- Bisimulation can't be traced
- Trees from Functions as Processes
- Coinduction All the Way Up
- Divide and Congruence II
- Eager Functions as Processes
- Productive coprogramming with guarded recursion
- An Alternative Order for the Failures Model
- Theoretical Aspects of Computing – ICTAC 2005
- Enhancements of the bisimulation proof method
This page was built for publication:
