Trace simulation semantics is not finitely based over BCCSP
This note shows that the trace simulation preorder does not have a finite inequational basis over the language BCCSP. Indeed, no collection of sound inequations of bounded depth is ground-complete with respect to the trace simulation preorder over BCCSP even over a singleton set of actions.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Algebra, Kibernetika, Számítástechnika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.1.2017.6 |
| Online Access: | http://acta.bibl.u-szeged.hu/50064 |
| Tartalmi kivonat: | This note shows that the trace simulation preorder does not have a finite inequational basis over the language BCCSP. Indeed, no collection of sound inequations of bounded depth is ground-complete with respect to the trace simulation preorder over BCCSP even over a singleton set of actions. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 81-90 |
| ISSN: | 0324-721X |