Results 1  10
of
17,837
Regular Linear Temporal Logic
, 2007
"... We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as subexpressions. Every LTL operator can be defined as a context in regular linear temporal logic. This implies that there is a (linear) translat ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as subexpressions. Every LTL operator can be defined as a context in regular linear temporal logic. This implies that there is a (linear
Linear Temporal Logic Specifications
, 2001
"... presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used as obse ..."
Abstract
 Add to MetaCart
presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used
An automatatheoretic approach to linear temporal logic
 Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science
, 1996
"... Abstract. The automatatheoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over s ..."
Abstract

Cited by 295 (26 self)
 Add to MetaCart
Abstract. The automatatheoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over
Regular Linear Temporal Logic with Past
"... Abstract. This 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 expressio ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. This 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
On the Satisfiability of Indexed Linear Temporal Logics∗
"... Indexed Linear Temporal Logics (ILTL) are an extension of standard Linear Temporal Logics (LTL) with quantifications over index variables which range over a set of process identifiers. ILTL has been widely used in specifying and verifying properties of parameterised systems, e.g., in parameterised m ..."
Abstract
 Add to MetaCart
Indexed Linear Temporal Logics (ILTL) are an extension of standard Linear Temporal Logics (LTL) with quantifications over index variables which range over a set of process identifiers. ILTL has been widely used in specifying and verifying properties of parameterised systems, e.g., in parameterised
LTLC: Linear Temporal Logic for Control
"... Abstract. Linear 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. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract. Linear 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
Bounded Realizability of Linear Temporal Logic
, 2008
"... The realizability problem is to decide whether there exists a program that implements a given specification. Realizability is related to the model checking problem, but during the past 25 years the research devoted to the latter has given rise to many procedures that are being brought into effect ..."
Abstract
 Add to MetaCart
in the industry, whereas the former has remained mainly of theoretical interest. This paper considers specifications written in the Linear Temporal Logic (LTL). The greatest challenge in checking the realizability of an LTL formula is the algorithmic complexity of the current approaches. Recent notable
Linear temporal logic and Z refinement
 Algebraic Methodology and Software Technology (AMAST 2004), volume 3116 of LNCS
, 2004
"... Abstract. Since Z, being a statebased language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also in terms of its state. One means of doing this is to use Linear Temporal Logic (LTL) in which properties abou ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. Since Z, being a statebased language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also in terms of its state. One means of doing this is to use Linear Temporal Logic (LTL) in which properties
Transformational Verification of Linear Temporal Logic
"... Abstract. We present a new method for verifying Linear Temporal Logic (LTL) properties of finite state reactive systems based on logic programming and program transformation. We encode a finite state system and an LTL property which we want to verify as a logic program on infinite lists. Then we app ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present a new method for verifying Linear Temporal Logic (LTL) properties of finite state reactive systems based on logic programming and program transformation. We encode a finite state system and an LTL property which we want to verify as a logic program on infinite lists. Then we
Results 1  10
of
17,837