Publication: Trace simulation semantics is not finitely based over BCCSP
Loading...
Full text at PDC
Publication Date
2017
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
University of Szeged
Citations
Exportar
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.