Results 21 to 30 of about 138,161 (315)
Reasoning about Intuitionistic Computation Tree Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2023 In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes. Subsequently, we define the syntax and semantics of our intuitionistic version of CTL and study some simple properties of ...
Catta D., Malvone V., Murano A.
openaire +4 more sources
Inferring Properties in Computation Tree Logic [PDF]
, 2023 We consider the problem of automatically inferring specifications in the branching-time logic, Computation Tree Logic (CTL), from a given system. Designing functional and usable specifications has always been one of the biggest challenges of formal methods.
Roy, Rajarshi, Neider, Daniel
openaire +3 more sources
Natural deduction calculus for computation tree logic [PDF]
IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06), 2006 The authors present a natural deduction calculus for the computation tree logic, CTL, defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens
Bolotov, A. +5 more
core +5 more sources
Computation tree logic model checking based on possibility measures [PDF]
Fuzzy Sets and Systems, 2015 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 ...
Li, Yongming, Li, Yali, Ma, Zhanyou
openaire +4 more sources
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +4 more sources
Strategic (Timed) Computation Tree Logic [PDF]
, 2023 We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e., STCTL is interpreted over networks of extended Timed Automata (TA) that either make synchronous moves or synchronise via joint actions ...
Arias, Jaime +4 more
openaire +4 more sources
SAT-Based Learning of Computation Tree Logic [PDF]
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
openaire +3 more sources
Exogenous Probabilistic Computation Tree Logic
Electronic Notes in Theoretical Computer Science, 2007 AbstractWe define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evolution is modelled by probabilistic Kripke structures that capture both stochastic and non–deterministic transitions.
Baltazar, Pedro +3 more
openaire +2 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 +3 more sources
Using fuzzy logic and mathematical models to predict the financial efficiency of industrial enterprises. [PDF]
PLoS ONEThe frequent development and unpredictable, dynamic nature of industrial enterprises require an effective financial efficiency detection process.
Yanyan Dong
doaj +2 more sources