Computation Tree Logic Model Checking over Possibilistic Decision Processes Under Finite-Memory Scheduler

2021 ◽  
pp. 75-88
Author(s):  
Wuniu Liu ◽  
Qing He ◽  
Yongming Li
Keyword(s):  
Model Checking ◽  
Decision Processes ◽  
Logic Model ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Finite Memory ◽  
Logic Model Checking

scholarly journals QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS

2008 ◽  
Vol 06 (02) ◽  
pp. 219-236 ◽  
Author(s):  
P. BALTAZAR ◽  
R. CHADHA ◽  
P. MATEUS
Keyword(s):  
Model Checking ◽  
Quantum Computation ◽  
Propositional Logic ◽  
Key Distribution ◽  
Logic Model ◽  
Quantum States ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Complete Axiomatization ◽  
Logic Model Checking

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 model-checking algorithm for QCTL. Finally, we illustrate the use of the logic by reasoning about the BB84 key distribution protocol.

Computation Tree Logic Formula Model Checking Using DNA Computing

2020 ◽  
Vol 15 (5) ◽  
pp. 620-629
Author(s):  
Ying-Jie Han ◽  
Jian-Wei Wang ◽  
Chun Huang ◽  
Qing-Lei Zhou
Keyword(s):  
Model Checking ◽  
Dna Computing ◽  
Deoxyribonucleic Acid ◽  
Logic Model ◽  
Dna Molecules ◽  
Computation Tree Logic ◽  
Logic Formula ◽  
Computation Tree ◽  
New Methods ◽  
Logic Model Checking

Computation tree logic model checking is a formal verification technology that can ensure the correctness of systems. The vast storage density of deoxyribonucleic acid (DNA) molecules and the massive parallelism of DNA computing offer new methods for computation tree logic model checking. In this study, we propose a computation tree logic model checking method based on DNA computing. First, a system to-be-checked and a computation tree logic formula are encoded by single-stranded DNA molecules. Second, these singlestranded DNA molecules are mixed to spontaneously hybridize and form partial or complete double-stranded molecules. Finally, a series of molecular manipulations are applied to detect the double-stranded molecules so that the result whether the system satisfies the computation tree logic formula is obtained. Biological simulations confirm the validity of the new method.

Bounded Model Checking for Probabilistic Computation Tree Logic

2012 ◽  
Vol 23 (7) ◽  
pp. 1656-1668 ◽  
Author(s):  
Cong-Hua ZHOU ◽  
Zhi-Feng LIU ◽  
Chang-Da WANG
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Probabilistic Computation ◽  
Computation Tree Logic ◽  
Computation Tree
Sign in / Sign up

Export Citation Format

Share Document