Impossibility Results for the Equational Theory of Timed CCS
From MaRDI portal
Publication:3612485
DOI10.1007/978-3-540-73859-6_6zbMath1214.68240OpenAlexW1499259757MaRDI QIDQ3612485
No author found.
Publication date: 10 March 2009
Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/86d2c351-515f-4271-b003-db2929736319
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Equational classes, universal algebra in model theory (03C05)
Related Items
Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?