The finite satisfiability problem for PCTL is undecidable (Q6970256)
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 8053997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The finite satisfiability problem for PCTL is undecidable |
scientific article; zbMATH DE number 8053997 |
Statements
The finite satisfiability problem for PCTL is undecidable (English)
0 references
18 June 2025
0 references
probabilistic temporal logics
0 references
satisfiability
0 references
PCTL
0 references
0 references
