Axiomatizing weak simulation semantics over BCCSP
This paper is devoted to the study of the (in) equational theory of the largest (pre)
congruences over the language BCCSP induced by variations on the classic simulation …
congruences over the language BCCSP induced by variations on the classic simulation …
[PDF][PDF] Decidability of bisimilarity and axiomatisation for sequential processes in the presence of intermediate termination
A Belder - 2018 - pure.tue.nl
An alternative semantics for sequential composition in a setting with intermediate
termination was proposed in a recent article by Baeten, Luttik and Yang. This thesis …
termination was proposed in a recent article by Baeten, Luttik and Yang. This thesis …
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
This note shows that the complete and the ready simulation preorders do not have a finite
inequational basis over the language BCCSP when the set of actions is a singleton …
inequational basis over the language BCCSP when the set of actions is a singleton …
[PDF][PDF] A Complete Bibliography of Publications in Information Processing Letters: 2000–2009
NHF Beebe - 2023 - ctan.math.utah.edu
A Complete Bibliography of Publications in Information Processing Letters: 2000–2009
Page 1 A Complete Bibliography of Publications in Information Processing Letters: 2000–2009 …
Page 1 A Complete Bibliography of Publications in Information Processing Letters: 2000–2009 …