| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428630 | Information Processing Letters | 2011 | 6 Pages |
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. Moreover, the equivalences induced by those preorders do not have a finite (in)equational axiomatization either. These results are in contrast with a claim of finite axiomatizability for those semantics in the literature, which was based on the erroneous assumption that they coincide with complete trace semantics in the presence of a singleton set of actions.
Research highlights► Complete simulation semantics has no finite basis over BCCSP with a single action. ► Ready simulation semantics is not finitely based over BCCSP with a single action. ► No complete axiomatization of bounded depth exists for either semantics.
