On Finite Alphabets and Infinite Bases III: Simulation
From MaRDI portal
Publication:5756593
DOI10.1007/11817949_28zbMath1151.68519OpenAlexW2162466826MaRDI QIDQ5756593
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817949_28
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
On finite alphabets and infinite bases ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
This page was built for publication: On Finite Alphabets and Infinite Bases III: Simulation