The following publications are possibly variants of this publication:
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabetLuca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir. ipl, 111(9):408-413, 2011. [doi]
- Axiomatizing Weak Ready Simulation Semantics over BCCSPLuca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir. ictac 2011: 7-24 [doi]
- Axiomatizing weak simulation semantics over BCCSPLuca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir. TCS, 537:42-71, 2014. [doi]
- A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed TracesLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. mscs, 8(3):193-230, 1998.
- The Equational Theory of Weak Complete Simulation Semantics over BCCSPLuca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir. sofsem 2012: 141-152 [doi]
- Nested semantics over finite trees are equationally hardLuca Aceto, Wan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir. iandc, 191(2):203-232, 2004. [doi]