Local and global deadlock-detection in component-based systems are NP-hard (Q2379953)
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: Local and global deadlock-detection in component-based systems are NP-hard |
scientific article; zbMATH DE number 5686400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local and global deadlock-detection in component-based systems are NP-hard |
scientific article; zbMATH DE number 5686400 |
Statements
Local and global deadlock-detection in component-based systems are NP-hard (English)
0 references
24 March 2010
0 references
computational complexity
0 references
concurrency
0 references
safety/security in digital systems
0 references
0 references
0.8090199828147888
0 references
0.7363536357879639
0 references
0.7341406941413879
0 references
