Results 31 to 40 of about 138,161 (315)

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics [PDF]

We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are equivalent to coalgebraic semantics, for all branching types.
Kojima, Ryota, Cirstea, Corina
  +6 more sources

A clausal resolution for extended computation tree logic ECTL [PDF]

, 2003
A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL).
Bolotov, A., Bolotov, A.
core   +1 more source

Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking [PDF]

Axioms
The encapsulation of particular quality functions and predicates within temporal logic formulas markedly enhances the representation of detailed temporal characteristics within a system.
Xianfeng Yu, Yongming Li, Shengling Geng, Huirong Li   +3 more
doaj   +2 more sources

Computation Tree Logic Guided Program Repair

IEEE Transactions on Software Engineering
Temporal logics like Computation Tree Logic (CTL) have been widely used as expressive formalisms to capture rich behavioral specifications. CTL can express properties such as reachability, termination, invariants and responsiveness, which are difficult to test.
Liu, Yu, Song, Yahui, Mirchev, Martin, Roychoudhury, Abhik   +3 more
openaire   +3 more sources

Graded computation tree logic [PDF]

ACM Transactions on Computational Logic, 2009
In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard existential and universal modalities in such a way that they can express statements about a given number of immediately accessible worlds.
A. Bianco, F. Mogavero, MURANO, ANIELLO
openaire   +4 more sources

HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems [PDF]

Logical Methods in Computer Science, 2023
Hyperproperties are system properties that relate multiple computation paths in a system and are commonly used to, e.g., define information-flow policies.
Raven Beutner, Bernd Finkbeiner
doaj   +1 more source

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization

Possibilistic computation tree Logic (PoCTL) is one kind of branching temporal logic combined with uncertain information in possibility theory, which was introduced in order to cope with the systematic verification on systems with uncertain information in possibility theory.
Yongming Li
openaire   +3 more sources

A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita, Shigeki Hagihara, Naoki Yonezaki   +2 more
doaj   +1 more source

The Logic of Homophily Dynamics in Heterogeneous Networks: Axiomatization, Model Checking and Validity Checking

Mathematics, 2023
Social networks have received considerable attention from the modal logic community. In this article, we study and characterize one of the most important principles in the field of social networks.
Xiling Luo
doaj   +1 more source

A New Type of Classical Logic Circuit with Exponential Speedup

Advanced Intelligent Systems, 2023
Compared with classical algorithms, quantum algorithms can show the advantage of exponential speedup in solving some problems. Solving the NAND‐Tree problem is a typical example, which can be speed up exponentially by quantum walk.
Yingji Zhang, Tian Chen, Xiaoxue Tong, Naiqiao Pan, Xiangdong Zhang   +4 more
doaj   +1 more source