Nested semantics over finite trees are equationally hard (Q598202): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:42, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nested semantics over finite trees are equationally hard |
scientific article |
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
