Hardness of preorder checking for basic formalisms (Q650916): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of preorder checking for basic formalisms |
scientific article |
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
