On the Decidability and Expressive Power of Timed Interval Temporal Logic
Qinglei Zhou
Abstract
Qinglei Zhou
Abstract
Model checking is used widely in verification of real-time system.Satisfiability of discrete Timed Interval Temporal Logic is decidable,so is model checking of it.But in dense-time domain,the problem of model checking Timed Interval Temporal Logic is not clear.We prove that Satisfiability of Timed Interval Temporal Logic is un-decidable and we find a subset of Timed Interval Temporal Logic which can be decidable.So,it can be decidable to model checking the subset.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Model checking is used widely in verification of real-time system.Satisfiability of discrete Timed Interval Temporal Logic is decidable,so is model checking of it.But in dense-time domain,the problem of model checking Timed Interval Temporal Logic is not clear.We prove that Satisfiability of Timed Interval Temporal Logic is un-decidable and we find a subset of Timed Interval Temporal Logic which can be decidable.So,it can be decidable to model checking the subset.
Key concepts: Interval temporal logic, Decidability, Temporal logic, Computer science, Linear temporal logic, Computation tree logic, Model checking, Satisfiability