Work

Trace Simulation Semantics is not Finitely Based over BCCSP

Year: 2017

Type: article

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.

Source: Acta Cybernetica

DOI: 10.14232/actacyb.23.1.2017.6

Authors: Luca Aceto, David de Frutos Escrig, Anna Ingólfsdóttir

Institutions: Reykjavík University, Universidad Complutense de Madrid

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2611533100

FWCI:

Cites: 30

Cited by:

Related to: 10