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.
Trace Simulation Semantics is not Finitely Based over BCCSP
Aceto L;
2017-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2017_Acta Cybern_23_Aceto.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Accesso gratuito
Dimensione
311.27 kB
Formato
Adobe PDF
|
311.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
