On the Axiomatizability of Impossible Futures

DOI10.2168/LMCS-11(3:17)2015zbMath1448.68335arXiv1505.04985MaRDI QIDQ3196348

Taolue Chen, W. J. Fokkink, Robert J. van Glabbeek

Publication date: 29 October 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04985

zbMATH Keywords

process algebraequational logicconcurrency theoryimpossible futures

Mathematics Subject Classification ID

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

Related Items

The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction ⋮ Axiomatizing weak simulation semantics over BCCSP