scholarly journals An axiomatization of full Computation Tree Logic

2001 ◽  
Vol 66 (3) ◽  
pp. 1011-1057 ◽  
Author(s):  
M. Reynolds
Keyword(s):  
Temporal Logic ◽  
Open Problem ◽  
Branching Time ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Complete Axiomatization

AbstractWe give a sound and complete axiomatization for the full computation tree logic. CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.

scholarly journals The temporal logic of coalgebras via Galois algebras

2002 ◽  
Vol 12 (6) ◽  
pp. 875-903 ◽  
Author(s):  
BART JACOBS
Keyword(s):  
State Space ◽  
Temporal Logic ◽  
Metric Spaces ◽  
Linear Temporal Logic ◽  
The State ◽  
Temporal Logics ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Polynomial Functors

This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how ‘fuzzy’ predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner.

Logical foundations of hierarchical model checking

2018 ◽  
Vol 52 (4) ◽  
pp. 539-563 ◽  
Author(s):  
Norihiro Kamide
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Hierarchical Model ◽  
Design Methodology ◽  
Linear Time ◽  
Hierarchical Systems ◽  
Content Type ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Linear Time Temporal Logic

Purpose The purpose of this paper is to develop new simple logics and translations for hierarchical model checking. Hierarchical model checking is a model-checking paradigm that can appropriately verify systems with hierarchical information and structures. Design/methodology/approach In this study, logics and translations for hierarchical model checking are developed based on linear-time temporal logic (LTL), computation-tree logic (CTL) and full computation-tree logic (CTL*). A sequential linear-time temporal logic (sLTL), a sequential computation-tree logic (sCTL), and a sequential full computation-tree logic (sCTL*), which can suitably represent hierarchical information and structures, are developed by extending LTL, CTL and CTL*, respectively. Translations from sLTL, sCTL and sCTL* into LTL, CTL and CTL*, respectively, are defined, and theorems for embedding sLTL, sCTL and sCTL* into LTL, CTL and CTL*, respectively, are proved using these translations. Findings These embedding theorems allow us to reuse the standard LTL-, CTL-, and CTL*-based model-checking algorithms to verify hierarchical systems that are modeled and specified by sLTL, sCTL and sCTL*. Originality/value The new logics sLTL, sCTL and sCTL* and their translations are developed, and some illustrative examples of hierarchical model checking are presented based on these logics and translations.

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.

scholarly journals Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations

2020 ◽  
Vol 64 (8) ◽  
pp. 1553-1610
Author(s):  
Ullrich Hustadt ◽  
Ana Ozaki ◽  
Clare Dixon
Keyword(s):  
Temporal Logic ◽  
Traffic Management ◽  
Monotonic Function ◽  
The Other ◽  
Branching Time ◽  
Metric Temporal Logic ◽  
Time Points ◽  
Computation Tree ◽  
Better Than ◽  
Time Point

Abstract We study translations from metric temporal logic (MTL) over the natural numbers to linear temporal logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (i) a strict monotonic function and by (ii) a non-strict monotonic function (which allows multiple states to be mapped to the same time point). We use this logic to model examples from robotics, traffic management, and scheduling, discussing the effects of different modelling choices. Our translations allow us to utilise LTL solvers to solve satisfiability and we empirically compare the translations, showing in which cases one performs better than the other. We also define a branching-time version of the logic and provide translations into computation tree logic.

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

scholarly journals Decision procedures and expressiveness in the temporal logic of branching time

1985 ◽  
Vol 30 (1) ◽  
pp. 1-24 ◽  
Author(s):  
E.Allen Emerson ◽  
Joseph Y. Halpern
Keyword(s):  
Temporal Logic ◽  
Decision Procedures ◽  
Branching Time

Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic

2014 ◽  
pp. 107-115 ◽  
Author(s):  
Bożena Woźna-Szcześniak ◽  
Ireneusz Szcześniak ◽  
Agnieszka M. Zbrzezny ◽  
Andrzej Zbrzezny
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Computation Tree Logic ◽  
Computation Tree

scholarly journals Design verification of a microprocessor using branching time regular temporal logic

1993 ◽  
pp. 206-219
Author(s):  
Kiyoharu Hamaguchi ◽  
Hiromi Hiraishi ◽  
Shuzo Yajima
Keyword(s):  
Temporal Logic ◽  
Design Verification ◽  
Branching Time

Visual specification of branching time temporal logic

2002 ◽  
Author(s):  
A. Del Bimbo ◽  
L. Rella ◽  
E. Vicario
Keyword(s):  
Temporal Logic ◽  
Branching Time ◽  
Visual Specification
Sign in / Sign up

Export Citation Format

Share Document