Behavioural equivalences on finite-state systems are PTIME-hard (Q3424633)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5130594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Behavioural equivalences on finite-state systems are PTIME-hard |
scientific article; zbMATH DE number 5130594 |
Statements
7 March 2007
0 references
verification
0 references
finite transition systems
0 references
bisimulation equivalence
0 references
trace equivalence
0 references
computational complexity
0 references
PTIME-hardness
0 references
0.8001897931098938
0 references
0.7806069254875183
0 references
