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 |
| LEADER | 01189nab a2200265 i 4500 | ||
|---|---|---|---|
| 001 | acta50064 | ||
| 005 | 20220620140438.0 | ||
| 008 | 180212s2017 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.23.1.2017.6 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Aceto Luca | |
| 245 | 1 | 0 | |a Trace simulation semantics is not finitely based over BCCSP |h [elektronikus dokumentum] / |c Aceto Luca |
| 260 | |c 2017 | ||
| 300 | |a 81-90 | ||
| 490 | 0 | |a Acta cybernetica |v 23 No. 1 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Matematika | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Algebra, Kibernetika, Számítástechnika | ||
| 700 | 0 | 1 | |a Escrig David de Frutos |e aut |
| 700 | 0 | 1 | |a Ingólfsdóttir Anna |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/50064/1/actacyb_23_1_2017_6.pdf |z Dokumentum-elérés |