Temporal logics with incommensurable distances are undecidable.
Alexander RabinovichPublished in: Inf. Comput. (2007)
Keyphrases
- temporal logic
- mazurkiewicz traces
- model checking
- modal logic
- concurrent systems
- satisfiability problem
- np complete
- distance measure
- transition systems
- predicate logic
- temporal knowledge
- distance function
- verification method
- linear temporal logic
- sufficient conditions
- computation tree logic
- finite state
- formal specification
- reactive systems
- reinforcement learning