Results 121 to 130 of about 18,393 (195)

Fast LTL satisfiability checking by sat solvers

open access: yes, 2014
. Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures.
Lijun Zhang   +4 more
core  

Deciding LTL over Mazurkiewicz traces

open access: yes, 2003
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata–theoretic approach has proven to be a very useful mechanism for performing automatic ...
Benedikt Bollig   +3 more
core   +1 more source

On the distributivity of LTL specifications

open access: yes, 2010
In this article, we investigate LTL specifications where γ [ϕ ∧ ψ] is equivalent to γ [ϕ] ∧ γ [ψ] independent of ϕ and ψ. Formulas γ with this property are called distributive queries because they naturally arise in Chan's seminal approach to temporal ...
Samer, Marko, Veith, Helmut
core   +1 more source

Optimal Complexity Bounds for Positive LTL Games

open access: yes, 2008
We prove two tight bounds on complexity of deciding graph games with winning conditions defined by formulas from fragments of LTL. Our first result is that deciding LTL+(#,#, games is in PSPACE.
Tomasz Truderung, Jerzy Marcinkowski
core  

LTL over finite traces for automatic system verification and synthesis

open access: yes
reservedQuesta tesi mira a presentare un’introduzione al problema della sintesi di sitemi a par- tire da formule . Il lavoro analizza i fondamenti di , , gli automi a stati finiti e le tecniche di traduzione da a DFA, oltre a presentare i ...
PIANTA, GIANLUCA
core  

The association between obesity and telomere shortening is mediated through total bilirubin. [PDF]

open access: yesCardiovasc Diabetol Endocrinol Rep
Zhou B   +5 more
europepmc   +1 more source

Implementing LTL Model Checking with Net Unfoldings

open access: yes, 2001
We report on an implementation of the unfolding approach to model-checking LTL-X recently presented by the authors. Contrary to that work, we consider an state-based version of LTL-X, which is more used in practice.
Keijo Heljanko   +8 more
core  

Home - About - Disclaimer - Privacy