The following pages link to (Q4381382):
Displaying 6 items.
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Specification in CTL + past for verification in CTL. (Q1854327) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- (Q4412853) (← links)