Equivalence checking of non-flat systems is EXPTIME-hard. (Q5900569)
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: Equivalence checking of non-flat systems is EXPTIME-hard. |
scientific article; zbMATH DE number 5688264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence checking of non-flat systems is EXPTIME-hard. |
scientific article; zbMATH DE number 5688264 |
Statements
CONCUR 2003 - Concurrency Theory (English)
0 references
30 March 2010
0 references
equivalence checking
0 references
finite-state systems
0 references
complexity
0 references
0.8723812699317932
0 references
0.7823833227157593
0 references
0.7758258581161499
0 references
0.7757066488265991
0 references
