Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation

DOI10.1007/978-3-642-40184-8_13zbMath1390.68476OpenAlexW826483376MaRDI QIDQ2842104

Vasileios Koutavas, Matthew C. B. Hennessy

Publication date: 12 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40184-8_13

Mathematics Subject Classification ID

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

This page was built for publication: Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation