Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984568289 / rank | |||
Normal rank | |||
Revision as of 19:28, 19 March 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
