Bisimulations Up-to: Beyond First-Order Transition Systems

DOI10.1007/978-3-662-44584-6_8zbMath1388.68200OpenAlexW142142968MaRDI QIDQ3190111

Damien Pous, Jean-Marie Madiot, Davide Sangiorgi

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_8

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Proving soundness of extensional normal-form bisimilarities ⋮ Parameterizing higher-order processes on names and processes ⋮ Towards `up to context' reasoning about higher-order processes ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Bisimulations Up-to: Beyond First-Order Transition Systems