On the Complexity of Branching-Time Logics (Q3644771)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Branching-Time Logics |
scientific article |
Statements
On the Complexity of Branching-Time Logics (English)
0 references
12 November 2009
0 references
branching-time logic
0 references
CTL
0 references
complexity of satisfiability
0 references
pebble automata
0 references
alternating tree automata
0 references
forgettable past
0 references
