Hardness of preorder checking for basic formalisms (Q650916)
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: Hardness of preorder checking for basic formalisms |
scientific article; zbMATH DE number 5987005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of preorder checking for basic formalisms |
scientific article; zbMATH DE number 5987005 |
Statements
Hardness of preorder checking for basic formalisms (English)
0 references
7 December 2011
0 references
behavioral preorders and equivalences
0 references
preorder and equivalence checking
0 references
non-flat finite-state systems
0 references
timed automata
0 references
computational complexity
0 references
0.9969993233680724
0 references
0.7680361866950989
0 references
0.76675945520401
0 references
