Results 21 to 30 of about 6,826 (311)
Logical Methods in Computer Science, 2013 This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and
François Laroussinie +2 more
doaj +1 more source
More efficient proof-search for sequents of temporal logic
Lietuvos Matematikos Rinkinys, 2022 The present paper deals with efficiency improvement of backward proof-search of sequents of propositional linear temporal logic, using a loop-type sequent calculus.
Romas Alonderis
doaj +1 more source
The Logic of Temporal Domination [PDF]
2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF), 2019 In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of temporal domination, in which the above condition can be expressed.
openaire +2 more sources
Model checking linear coalgebraic temporal logics: an automata-theoretic approach [PDF]
, 2011 We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras.
Cirstea, Corina, Corina Cîrstea
core +1 more source
Substructure Temporal Logic [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL, for short ...
BENERECETTI, MASSIMO +2 more
openaire +2 more sources
Reasoning about XML with temporal logics and automata [PDF]
, 2010 We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs Many properties of interest in the XML context are related to ...
Leonid Libkin +3 more
core +1 more source
Dynamic Cantor Derivative Logic [PDF]
Logical Methods in Computer Science, 2023 Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as $d$-logics. Unlike logics based on the topological closure operator, $d$-logics have not previously been studied in the ...
David Fernández-Duque, Yoàv Montacute
doaj +1 more source
A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]
Logical Methods in Computer Science, 2022 The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL.
Michele Chiari +2 more
doaj +1 more source
Polynomial Algorithm of Verication for Subset of PLTL Logic
Моделирование и анализ информационных систем, 2015 In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). The algorithm allows to find probability of
P. V. Lebedev
doaj +1 more source
LTL-Specification of Counter Machines
Моделирование и анализ информационных систем, 2021 The article is written in support of the educational discipline “Non-classical logics”. Within the framework of this discipline, the objects of study are the basic principles and constructive elements, with the help of which the formal construction of ...
Egor V. Kuzmin
doaj +1 more source