QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
نویسندگان
چکیده
منابع مشابه
Quantum Computation Tree Logic – Model checking and complete calculus
Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper we consider Quantum Computation Tree Logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL model-checking algorithm with the dEQPL model-checking algorithm to obtain a mode...
متن کاملModel Checking Extended Computation Tree Logic
Computation Tree Logic is widely used for modelling the behaviour of simple systems over time, but its expressive power is limited. More powerful logics such as CTL* and the modal mu-calculus have the disadvantage that their model-checking problems are comparatively intractable, and they can be unintuitive. A recent contribution by Axelsson et al. introduces the `Extended CTL' family of logics,...
متن کاملModel Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal operators. In this paper we study Quantified Computation Tree Logic (QCTL), which extends the well-known p...
متن کاملComputation Tree Logic Model Checking Based on Possibility Measures
In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li [19] introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue, Lei and Li [26] defined computation tree logic (CTL) based on possibility measures, which is called possibilistic CTL (PoCTL). This paper is a continuation of the a...
متن کاملNatural Deduction Calculus for Computation Tree Logic CTL
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various applications in AI and Comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2008
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s0219749908003530