Nested semantics over finite trees are equationally hard (Q598202)
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: Nested semantics over finite trees are equationally hard |
scientific article; zbMATH DE number 2083132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nested semantics over finite trees are equationally hard |
scientific article; zbMATH DE number 2083132 |
Statements
Nested semantics over finite trees are equationally hard (English)
0 references
6 August 2004
0 references
Concurrency
0 references
Process algebra
0 references
BCCSP
0 references
Nested simulation
0 references
Possible futures
0 references
Nested trace semantics
0 references
Equational logic
0 references
Complete axiomatizations
0 references
Non-finitely based algebras
0 references
Hennessy--Milner logic
0 references
0 references
0 references
0.8435868620872498
0 references
0.7906832098960876
0 references
0.7663895487785339
0 references
0.7638611793518066
0 references
