Complexity results on branching-time pushdown model checking (Q2373715)
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 5171339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results on branching-time pushdown model checking |
scientific article; zbMATH DE number 5171339 |
Statements
Complexity results on branching-time pushdown model checking (English)
0 references
16 July 2007
0 references
infinite-state systems
0 references
pushdown systems
0 references
model checking
0 references
regular propositional temporal logics
0 references
0 references
0.9918066263198853
0 references
0.8604407906532288
0 references
0.8450707793235779
0 references
