scientific article
From MaRDI portal
Publication:3384919
Publication date: 17 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2018.10
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to concurrency theory. Transition systems and CCS
- An efficiency preorder for processes
- Edinburgh LCF. A mechanized logic of computation
- Formalising a value-passing calculus in H0L
- Understanding concurrent systems
- New up-to techniques for weak bisimulation
- Equations, Contractions, and Unique Solutions
- A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
- Introduction to Bisimulation and Coinduction
- Formalising the pi-calculus using nominal logic
- Implementing Spi Calculus Using Nominal Techniques
- A Brief Overview of HOL4
- CCS(25,12) is Turing-complete
- Barbed bisimulation
- Equations, Contractions, and Unique Solutions
- Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication:
