Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders.
Philippe BalbianiSzabolcs MikulásPublished in: FroCos (2013)
Keyphrases
- temporal logic
- automata theoretic
- model checking
- modal logic
- satisfiability problem
- linear temporal logic
- decision procedures
- computation tree logic
- computational complexity
- concurrent systems
- belief revision
- description logics
- verification method
- query answering
- bounded model checking
- formal verification
- temporal knowledge
- transition systems
- temporally extended