Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet |
scientific article; zbMATH DE number 6149195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet |
scientific article; zbMATH DE number 6149195 |
Statements
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (English)
0 references
28 March 2013
0 references
concurrency
0 references
process algebra
0 references
complete simulation
0 references
ready simulation
0 references
equational logic
0 references
non-finitely based algebras
0 references
0 references
0.895305871963501
0 references
0.8588618040084839
0 references
0.8569732308387756
0 references
0.8547763228416443
0 references
0.8321374654769897
0 references
