The complexity of bounded context switching with dynamic thread creation (Q6842459)
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 8174015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of bounded context switching with dynamic thread creation |
scientific article; zbMATH DE number 8174015 |
Statements
The complexity of bounded context switching with dynamic thread creation (English)
0 references
18 March 2026
0 references
dynamic thread creation
0 references
bounded context switching
0 references
asynchronous programs
0 references
safety verification
0 references
state reachability
0 references
Petri nets
0 references
complexity
0 references
succinctness
0 references
counter programs
0 references
