Trace simulation semantics is not finitely based over BCCSP

DOI10.14232/ACTACYB.23.1.2017.6MaRDI QIDQ5350148zbMATH OpenOpenAlexFDO

Authors Luca Aceto, David de Frutos Escrig, Anna Ingolfsdottir

Publication date 25 August 2017

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.1.2017.6

zbMATH Keywords

BCCSPcomplete axiomatizationstrace simulation preorder

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• On Finite Alphabets and Infinite Bases III: Simulation
• Foundations of Software Science and Computation Structures
• The equational theory of weak complete simulation semantics over BCCSP
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces

Cited in

(5)

• Bisimilarity is not finitely based over BPA with interrupt
• Nested semantics over finite trees are equationally hard
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Algebra and Coalgebra in Computer Science
• Bisimulation can't be traced

This page was built for publication: Trace simulation semantics is not finitely based over BCCSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350148)