A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
From MaRDI portal
Publication:4236208
DOI10.1017/S0960129597002491zbMath0917.68138MaRDI QIDQ4236208
Luca Aceto, Anna Ingólfsdóttir, W. J. Fokkink
Publication date: 22 March 1999
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Related Items
Bisimilarity is not finitely based over BPA with interrupt, Nested semantics over finite trees are equationally hard, Axiomatizations for the perpetual loop in process algebra, Nonaxiomatisability of equivalences over finite state processes, The equational logic of fixed points, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Non-regular iterators in process algebra, A complete equational axiomatization for MPA with string iteration, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, Language preorder as a precongruence, The max-plus algebra of the natural numbers has no finite equational basis
