Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler (Q2090217)
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: Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler |
scientific article; zbMATH DE number 7606542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler |
scientific article; zbMATH DE number 7606542 |
Statements
Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler (English)
0 references
24 October 2022
0 references
possibilistic decision processes
0 references
generalized possibilistic computation tree logic
0 references
finite-memory schedulers
0 references
optimal schedulers
0 references
model checking
0 references
0 references
0.7763058543205261
0 references
0.7363823652267456
0 references
0.7303574681282043
0 references
0.7237251400947571
0 references
