Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: David de Frutos-Escrig / rank | |||
| Property / author | |||
| Property / author: Carlos Gregorio Rodríguez / rank | |||
Revision as of 00:28, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet |
scientific article |
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
