Results 91 to 100 of about 133,374 (215)

"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis

BMC Bioinformatics, 2011
Background In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role.
Arellano Gustavo, Argil Julián, Azpeitia Eugenio, Benítez Mariana, Carrillo Miguel, Góngora Pedro, Rosenblueth David A, Alvarez-Buylla Elena R   +7 more
doaj   +1 more source

A clausal resolution method for extended computation tree logic ECTL

Journal of Applied Logic, 2006
AbstractA 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). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in ...
Artie Basukoski, Alexander Bolotov
openaire   +2 more sources

Probabilistic Model Checking GitHub Repositories for Software Project Analysis

Applied Sciences
GitHub serves as a platform for collaborative software development, where contributors engage, evolve projects, and shape the community. This study presents a novel approach to analyzing GitHub activity that departs from traditional methods.
Suhee Jo, Ryeonggu Kwon, Gihwon Kwon
doaj   +1 more source

Formal Modelling and Verification of Multi-Parameter Context and Agent Transition Systems: Application to Urban Delivery Zone and Autonomous Electric Vehicle

World Electric Vehicle Journal
The increasing integration of autonomous electric vehicles (EVs) into Intelligent Transportation Systems (ITSs) needs rigorous mechanisms to ensure their safe and effective operation in dynamic environments.
Abir Nemouchi, Ahmed Bouzenada, Djamel Eddine Saidouni, Gregorio Díaz   +3 more
doaj   +1 more source

Blockchain-enhanced smart contracts for formal verification of IoT access control mechanisms

Alexandria Engineering Journal
Technologies like Bluetooth and WiFi enable more and more devices to become interconnected, forming the IoT ecosystem. However, this growing connectivity brings significant security risks, especially in terms of access management.
Zhifeng Guo
doaj   +1 more source

Computation Tree Logic Guided Program Repair

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   +2 more sources

A Cyclic Proof System for Full Computation Tree Logic

, 2023
Full Computation Tree Logic, commonly denoted CTL∗ , is the extension of Linear Temporal Logic LTL by path quantification for reasoning about branching time. In contrast to traditional Computation Tree Logic CTL, the path quantifiers are not bound to specific linear modalities, resulting in a more expressive language.
Afshari, B., Leigh, G.E., Menéndez Turata, G.   +2 more
openaire   +3 more sources

Enabling MCTS Explainability for Sequential Planning Through Computation Tree Logic [PDF]

Ziyan An, Hendrik Baier, Abhishek Dubey, Ayan Mukhopadhyay, Meiyi Ma   +4 more
openalex   +3 more sources

Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic [PDF]

, 2018
Martin Lück
openalex   +1 more source

Memoization in Constraint Logic Programming

, 1993
This paper shows how to apply memoization (caching of subgoals and associated answer substitutions) in a constraint logic programming setting. The research is is motivated by the desire to apply constraint logic programming (CLP) to problems in natural ...
Johnson, Mark
core   +2 more sources