Results 51 to 60 of about 138,161 (315)
A clausal resolution method for branching-time logic ECTL+ [PDF]
, 2004 We expand the applicability of the clausal resolution technique to the branching-time temporal logic ECTL_. ECTL_ is strictly more expressive than the basic computation tree logic CTL and its extension, ECTL, as it allows Boolean combinations of ...
Basukoski, A. +3 more
core +2 more sources
An axiomatization of full Computation Tree Logic [PDF]
Journal of Symbolic Logic, 2001 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.
openaire +1 more source
Vectorized model checking for computation tree logic [PDF]
, 1991 The aim of this paper is to show how big model checking problems for Computation Tree Logic (CTL) can be handled by using current powerful vector processors. Although efficient recursive model checking algorithms for CTL, which run in time proportional to both the size of Kripke structures and the length of formulas, have been already proposed [7, 2 ...
Hiromi Hiraishi +2 more
openaire +1 more source
A Social Multi-Agent Cooperation System Based on Planning and Distributed Task Allocation
Information, 2020 Planning and distributed task allocation are considered challenging problems. To address them, autonomous agents called planning agents situated in a multi-agent system should cooperate to achieve planning and complete distributed tasks.
Atef Gharbi
doaj +1 more source
Rich Counter-Examples for Temporal-Epistemic Logic Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics.
Simon Busard, Charles Pecheur
doaj +1 more source
Reduction Model Checking for Multi-Agent Systems of Group Social Commitments
Computation, 2022 Innumerable industries now use multi-agent systems (MASs) in various contexts, including healthcare, security, and commercial deployments. It is challenging to select reliable business protocols for critically important safety-related systems (e.g., in ...
Bader M. AlFawwaz +2 more
doaj +1 more source
, 1998 We provide here a computational interpretation of first-order logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs.
Apt, Krzysztof R., Bezem, Marc
core +6 more sources
Validating Back-links of FOLID Cyclic Pre-proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions, the nodes of the tree derivations are labelled by sequents and the back-links connect particular ...
Sorin Stratulat
doaj +1 more source
An Approach of XML Query Evaluation Based Model Checking
Cybernetics and Information Technologies, 2016 In this paper, we show the process inspired by model checking which integrate temporal logic to the application of semi-structured data query. We investigate the potential ofatechnique based on CTL (Computation Tree Logic) model checking for evaluating ...
Yan-Mei Li, Shao-Bin Huang, Ya Li, Li Xu
doaj +1 more source
Counterexample Generation for Probabilistic Model Checking Micro-Scale Cyber-Physical Systems
Micromachines, 2021 Micro-scale Cyber-Physical Systems (MCPSs) can be automatically and formally estimated by probabilistic model checking, on the level of system model MDPs (Markov Decision Processes) against desired requirements in PCTL (Probabilistic Computation Tree ...
Yang Liu +3 more
doaj +1 more source