Results 21 to 30 of about 133,374 (215)
Relational Version of the Multi-agent Computation Tree Logic $\mathcal{CTLK}$
Известия Иркутского государственного университета: Серия "Математика"This paper deals with multi-agent computation tree logic --- $\mathcal{CTLK}$ (Computation Tree Logic with Knowledge). Each agent represents its own computational route of the initial problem, and new branches of possible computational routes spawn new ...
S. I. Bashmakov, K. A. Smelykh
doaj +2 more sources
Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking
AxiomsThe encapsulation of particular quality functions and predicates within temporal logic formulas markedly enhances the representation of detailed temporal characteristics within a system.
Xianfeng Yu +3 more
doaj +2 more sources
SAT-Based Learning of Computation Tree Logic
Abstract The learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size.
Adrien Pommellet +2 more
openalex +3 more sources
, 2022 It is widely accepted that every system should be robust in that “small” violations of environment assumptions should lead to “small” violations of system guarantees, but it is less clear how to make this intuition mathematically precise. While significant efforts have been devoted to providing notions of robustness for Linear Temporal Logic (LTL ...
Satya Prakash Nayak +3 more
openalex +4 more sources
Computation Tree Logic Model Checking Based on Possibility Measures [PDF]
Fuzzy Sets and Systems, 2014 In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li \cite{li12} introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue, Lei and Li \cite{Xue09} defined computation tree logic (CTL) based on possibility measures, which is called ...
Yongming Li, Yali Li, Zhanyou Ma
openalex +3 more sources
Finite-State Abstractions for Probabilistic Computation Tree Logic
, 2011 Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this ...
Wagner, Daniel, Wagner, Daniel
core +5 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
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 +2 more
doaj +1 more source
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 +4 more
doaj +1 more source