Results 61 to 70 of about 430,787 (365)

Incompleteness of a first-order Gödel logic and some temporal logics of programs [PDF]

open access: yes, 1996
It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant ...
Baaz, Matthias   +2 more
core   +2 more sources

Optimal Secure Control With Linear Temporal Logic Constraints [PDF]

open access: yesIEEE Transactions on Automatic Control, 2019
Prior work on automatic control synthesis for cyber-physical systems under logical constraints has primarily focused on environmental disturbances or modeling uncertainties, however, the impact of deliberate and malicious attacks has been less studied ...
Luyao Niu, Andrew Clark
semanticscholar   +1 more source

Grouping based calculus for propositional linear temporal logic

open access: yesLietuvos Matematikos Rinkinys
In this paper, the authors research the problem of loops in linear temporal logic PLTL. The task involves defining the standard rule application process for the derivation procedure (as used in [4] and [5]), determining and proving properties for the ...
Kostas Ragauskas, Adomas Birštunas
doaj   +3 more sources

Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints [PDF]

open access: yes, 2012
In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices ...
Belta, Calin   +2 more
core   +2 more sources

Regular Linear-Time Temporal Logic [PDF]

open access: yes2010 17th International Symposium on Temporal Representation and Reasoning, 2010
This extended abstract presents the main ideas behind regular linear-time temporal logic (RLTL), a logic that generalizes linear-time temporal logic (LTL) with the ability to use regular expressions arbitrarily as sub-expressions. Unlike LTL, RLTL can define all !-regular languages and unlike previous approaches, RLTL is defined with an algebraic ...
Martin Leucker, Cesar Sanchez
openaire   +1 more source

Polynomial Algorithm of Verication for Subset of PLTL Logic

open access: yesМоделирование и анализ информационных систем, 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   +3 more sources

Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality

open access: yesBulletin of the Section of Logic, 2022
This paper proposes a semantic description of the linear step-like temporal multi-agent logic with the universal modality \(\mathcal{LTK}.sl_U\) based on the idea of non-reflexive non-transitive nature of time.
Stepan I. Bashmakov, Tatyana Yu. Zvereva
doaj   +1 more source

A framework for proving the correctness of cryptographic protocol properties by linear temporal logic [PDF]

open access: yes, 2013
In this paper, a framework for cryptographic protocol analysis using linear temporal logic is proposed. The framework can be used to specify and analyse security protocols.
Abdullah Alabdulatif   +2 more
core   +1 more source

Frequency Linear-time Temporal Logic [PDF]

open access: yes2012 Sixth International Symposium on Theoretical Aspects of Software Engineering, 2012
We propose fLTL, an extension to linear-time temporal logic (LTL) that allows for expressing relative frequencies by a generalization of temporal operators. This facilitates the specification of requirements such as the deadlines in a real-time system must be met in at least 95% of all cases.
Bollig, Benedikt   +2 more
openaire   +2 more sources

Two Variable vs. Linear Temporal Logic in Model Checking and Games [PDF]

open access: yesLogical Methods in Computer Science, 2013
Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we consider two such restricted specification logics, linear temporal logic (LTL)
Michael Benedikt   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy