Trace simulation semantics is not finitely based over BCCSP

Aceto Luca and Escrig David de Frutos and Ingólfsdóttir Anna: Trace simulation semantics is not finitely based over BCCSP. In: Acta cybernetica, (23) 1. pp. 81-90. (2017)

[thumbnail of actacyb_23_1_2017_6.pdf]
Preview
Cikk, tanulmány, mű
actacyb_23_1_2017_6.pdf

Download (318kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2017
Volume: 23
Number: 1
ISSN: 0324-721X
Page Range: pp. 81-90
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/50021/
DOI: 10.14232/actacyb.23.1.2017.6
Uncontrolled Keywords: Algebra, Kibernetika, Számítástechnika
Additional Information: Bibliogr.: p. 88-90. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.01. Mathematics
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2018. Feb. 12. 09:00
Last Modified: 2022. Jun. 20. 14:04
URI: http://acta.bibl.u-szeged.hu/id/eprint/50064

Actions (login required)

View Item View Item