Results 291 to 300 of about 283,349 (325)
Some of the next articles are maybe not open access.
Adding partial orders to linear temporal logic
Fundamenta Informaticae, 1997Modeling execution as partial orders increases the flexibility in reasoning about concurrent programs by allowing the use of alternative, equivalent execution sequences. This is a desirable feature in specifying concurrent systems which allows formalizing frequently used arguments such as ‘in an equivalent execution sequence’, or ‘in a consistent ...
Girish Bhat, Doron Peled
openaire +4 more sources
2016
Linear-time temporal logics formalise reasoning about single computations in transition systems, represented by linear models over natural numbers, that is, infinite sequences of states of length ω . With linear-time formulae one can specify a rich variety of important properties of infinite computations; not only local ones, like BML, but also ...
Martin Lange +2 more
openaire +2 more sources
Linear-time temporal logics formalise reasoning about single computations in transition systems, represented by linear models over natural numbers, that is, infinite sequences of states of length ω . With linear-time formulae one can specify a rich variety of important properties of infinite computations; not only local ones, like BML, but also ...
Martin Lange +2 more
openaire +2 more sources
Nesting Until and Since in Linear Temporal Logic
Theory of Computing Systems, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Wilke, Denis Thérien
openaire +4 more sources
A Decision Method for Linear Temporal Logic
1984In this paper we define a new decision method for propositional temporal logic of programs. Temporal logic appears to be an appropriate tool to prove some properties of programs such as invariance or eventually because in this logic we define operators that enable us to represent properties that are valid during all the development of the program or ...
Ana Cavalli, Luis Fariñas del Cerro
openaire +2 more sources
A Paraconsistent Linear-time Temporal Logic
Fundamenta Informaticae, 2011Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time temporal logic (PLTL), is obtained semantically from the linear-time temporal logic LTL by adding a ...
Heinrich Wansing, Norihiro Kamide
openaire +1 more source
A model checker for linear time temporal logic
Formal Aspects of Computing, 1992Abstract This report describes the design and implementation of a model checker for linear time temporal logic. The model checker uses a depth-first search algorithm that attempts to find a minimal satisfying model and uses as little space as possible during the checking procedure.
openaire +3 more sources
Linear Temporal Logic of Constraint Automata
2008Constraint automata are formalisms to describe the behavior and possible data flow in coordination models. In this paper we introduce a linear time temporal logic, called temporal logic of steps (TLS), for specifying the executions of constraint automata. TLS is the first attempt in presenting a linear temporal logic for constraint automata. Having TLS
Sara Navidpour, Mohammad Izadi
openaire +2 more sources
Regular Linear Temporal Logic with Past
2010This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logic (LTL) to all ω-regular languages. The syntax of RLTL consists of an algebraic signature from which expressions are built.
César Sánchez, Martin Leucker
openaire +2 more sources
LTLC: Linear Temporal Logic for Control
2008Linear systems are one of the most commonly used models to represent physical systems. Yet, only few automated tools have been developed to check their behaviors over time. In this paper, we propose a linear temporal logic for specifying complex properties of discrete time linear systems.
Gul Agha, YoungMin Kwon
openaire +2 more sources
Gödel–Dummett linear temporal logic
Artificial IntelligenceWe investigate a version of linear temporal logic whose propositional fragment is G & ouml;del-Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics: first a real-valued semantics, where statements have a degree of truth in the real unit interval, and second a ...
Juan Pablo Aguilera +3 more
openaire +2 more sources

