Results 1  10
of
1,054,141
Regular Lineartime Temporal Logic
"... Abstract—This extended abstract presents the gist of regular lineartime temporal logic (RLTL), a logic that generalizes lineartime temporal logic (LTL) with the ability to use regular expressions arbitrarily as subexpressions. Unlike LTL, RLTL can define all ωregular languages and unlike previou ..."
Abstract
 Add to MetaCart
Abstract—This extended abstract presents the gist of regular lineartime temporal logic (RLTL), a logic that generalizes lineartime temporal logic (LTL) with the ability to use regular expressions arbitrarily as subexpressions. Unlike LTL, RLTL can define all ωregular languages and unlike
Frequency Lineartime Temporal Logic
"... Abstract—We propose fLTL, an extension to lineartime 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 realtime system must be met in at least 95 % of all case ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—We propose fLTL, an extension to lineartime 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 realtime system must be met in at least 95 % of all
Locally Linear Time Temporal Logic
 In LICS '96
, 1996
"... We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local nextinstants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agentsa ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local nextinstants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus
Natural deduction calculus for lineartime temporal logic
 In To be publsihed in the Proceedings of Jelia2006, LNAI 4160
, 2006
"... Abstract. We present a natural deduction calculus for the propositional lineartime temporal logic and prove its correctness. The system extends the natural deduction construction of the classical propositional logic. This will open the prospect to apply our technique as an automatic reasoning tool ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Abstract. We present a natural deduction calculus for the propositional lineartime temporal logic and prove its correctness. The system extends the natural deduction construction of the classical propositional logic. This will open the prospect to apply our technique as an automatic reasoning tool
The Axiomatization of Propositional Linear Time Temporal Logic
"... Summary. The article introduces propositional linear time temporal logic as a formal system. Axioms and rules of derivation are defined. Soundness Theorem and Deduction Theorem are proved [9]. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Summary. The article introduces propositional linear time temporal logic as a formal system. Axioms and rules of derivation are defined. Soundness Theorem and Deduction Theorem are proved [9].
Dynamic Linear Time Temporal Logic
 IN ANNALS OF PURE AND APPLIED LOGIC
, 1997
"... A simple extension of the propositional temporal logic of linear time is proposed. The extension consists of strengthening the until operator by indexing it with the regular programs of propositional dynamic logic (PDL). It is shown that DLTL, the resulting logic, is expressively equivalent to S ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
A simple extension of the propositional temporal logic of linear time is proposed. The extension consists of strengthening the until operator by indexing it with the regular programs of propositional dynamic logic (PDL). It is shown that DLTL, the resulting logic, is expressively equivalent
SequenceIndexed LinearTime Temporal Logic: Proof System and Application ∗
"... In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequenceindexed lineartime temporal logic (SLTL), is obtained semantically from standard lineartime temporal logic (LTL) by adding a sequence modal ope ..."
Abstract
 Add to MetaCart
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequenceindexed lineartime temporal logic (SLTL), is obtained semantically from standard lineartime temporal logic (LTL) by adding a sequence modal
A Model Checker for Linear Time Temporal Logic
 Formal Aspects of Computing
, 1992
"... This report describes the design and implementation of a model checker for linear time temporal logic. The model checker uses a depthfirst search algorithm that attempts to find a minimal satisfying model and uses as little space as possible during the checking procedure. The depthfirst nature of ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This report describes the design and implementation of a model checker for linear time temporal logic. The model checker uses a depthfirst search algorithm that attempts to find a minimal satisfying model and uses as little space as possible during the checking procedure. The depthfirst nature
Lineartime temporal logic and Büchi automata
, 1997
"... Over the past two decades, temporal logic has become a very basic tool for specifying properties of reactive systems. For finitestate systems, it is possible to use techniques based on Büchi automata to verify if a system meets its specifications. This is done by synthesizing an automaton which gen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Over the past two decades, temporal logic has become a very basic tool for specifying properties of reactive systems. For finitestate systems, it is possible to use techniques based on Büchi automata to verify if a system meets its specifications. This is done by synthesizing an automaton which
Results 1  10
of
1,054,141