Trace Simulation Semantics is not Finitely Based over BCCSP | Zendy

Luca Aceto | Zendy; David de Frutos Escrig | Zendy; Anna Ingólfsdóttir | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Trace Simulation Semantics is not Finitely Based over BCCSP

Author(s) -

Luca Aceto,

David de Frutos Escrig,

Anna Ingólfsdóttir

Publication year - 2017

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.23.1.2017.6

Subject(s) - trace (psycholinguistics) , singleton , preorder , computer science , semantics (computer science) , bounded function , set (abstract data type) , programming language , basis (linear algebra) , theoretical computer science , algorithm , mathematics , discrete mathematics , linguistics , pregnancy , mathematical analysis , philosophy , genetics , geometry , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research