On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions.
Laura BozzelliAlberto MolinariAngelo MontanariAdriano PeronPublished in: GandALF (2017)
Keyphrases
- temporal logic
- model checking
- regular expressions
- pspace complete
- pattern matching
- finite state machines
- modal logic
- temporal properties
- concurrent systems
- satisfiability problem
- formal specification
- verification method
- model checker
- finite state
- formal verification
- computation tree logic
- query language
- transition systems
- xml schema
- symbolic model checking
- tree automata
- bounded model checking
- formal methods
- epistemic logic
- linear temporal logic
- matching algorithm
- computational complexity
- regular path queries
- reactive systems
- temporally extended
- planning domains
- data model
- database
- query evaluation
- belief revision
- decision problems
- temporal epistemic