Results 171 to 180 of about 1,696,138 (202)
Some of the next articles are maybe not open access.
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 2003
D. Therien and T. Wilke (1996) characterized the Until hierarchy of linear temporal logic in terms of aperiodic monoids. Here, a temporal operator able to count modulo q is introduced. Temporal logic augmented with such operators is found decidable as it is shown to express precisely the solvable regular languages.
Augustin Baziramwabo +2 more
openaire +2 more sources
D. Therien and T. Wilke (1996) characterized the Until hierarchy of linear temporal logic in terms of aperiodic monoids. Here, a temporal operator able to count modulo q is introduced. Temporal logic augmented with such operators is found decidable as it is shown to express precisely the solvable regular languages.
Augustin Baziramwabo +2 more
openaire +2 more sources
The temporal logic of programs
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time dependence of events is the basic concept. Two formal systems are presented for providing a basis for temporal reasoning. One forms a formalization of the method
openaire +2 more sources
1999
We define a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Its canonical model is the real line (and not an ω-sequence of some type). We prove its decidability using general theorems from Logic (and not Automata theory). We show that it is as expressive as any alternative suggested in the
Yoram Hirshfeld +1 more
openaire +1 more source
We define a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Its canonical model is the real line (and not an ω-sequence of some type). We prove its decidability using general theorems from Logic (and not Automata theory). We show that it is as expressive as any alternative suggested in the
Yoram Hirshfeld +1 more
openaire +1 more source
1993
There are two typical ways to formalize reasoning over time. The first is in a modal logic where time is characterized implicitly through tense operators. The second addresses time explicitly in a first-order theory, where the reasoning is itself essentially first order.
Yuejun Jiang, Barry Richards
openaire +2 more sources
There are two typical ways to formalize reasoning over time. The first is in a modal logic where time is characterized implicitly through tense operators. The second addresses time explicitly in a first-order theory, where the reasoning is itself essentially first order.
Yuejun Jiang, Barry Richards
openaire +2 more sources
Fundamenta Informaticae, 1991
We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.
Fred Kröger, Stephan Merz
openaire +2 more sources
We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.
Fred Kröger, Stephan Merz
openaire +2 more sources
The Computer Journal, 1996
This paper presents a reified temporal logic for representing and reasoning about temporal and non-temporal relationships between non-temporal assertions. A clear syntax and semantics for the logic is formally provided. Three types of predicates, temporal predicates, non-temporal predicates and meta-predicates, are introduced.
Jixin Ma 0001, Brian Knight
openaire +1 more source
This paper presents a reified temporal logic for representing and reasoning about temporal and non-temporal relationships between non-temporal assertions. A clear syntax and semantics for the logic is formally provided. Three types of predicates, temporal predicates, non-temporal predicates and meta-predicates, are introduced.
Jixin Ma 0001, Brian Knight
openaire +1 more source
2013
Temporal Logic (TL) is a popular formalism, introduced into systems design [Pnu77] as a language for specifying acceptable behaviors of reactive systems. Traditionally, it has been used for formal verification, either by deductive methods [MP95], or algorithmic methods (Model Checking [CGP99,QS82]).
openaire +2 more sources
Temporal Logic (TL) is a popular formalism, introduced into systems design [Pnu77] as a language for specifying acceptable behaviors of reactive systems. Traditionally, it has been used for formal verification, either by deductive methods [MP95], or algorithmic methods (Model Checking [CGP99,QS82]).
openaire +2 more sources
A Temporal Logic of Robustness
2007It can be desirable to specify polices that require a system to achieve some outcome even if a certain number of failures occur. This paper proposes a logic, RoCTL*, which extends CTL* with operators from Deontic logic, and a novel operator referred to as "Robustly".
Tim French 0002 +2 more
openaire +2 more sources
In this paper we apply, to the minimal temporal calculusKt, the valuationsemantics proposed by A. M. Loparić for Kripke’s calculusK. After presenting an ax-iomatic basis and defining valuations for Kt, we prove correctness and completeness theorems.
Andrea M. Loparić, Cezar A. Mortari
openaire +2 more sources
Andrea M. Loparić, Cezar A. Mortari
openaire +2 more sources
The Knowledge Engineering Review, 1989
Abstract A series of temporal reasoning tasks are identified which motivate the consideration and application of temporal logics in artificial intelligence. There follows a discussion of the broad issues involved in modelling time and constructing a temporal logic.
openaire +2 more sources
Abstract A series of temporal reasoning tasks are identified which motivate the consideration and application of temporal logics in artificial intelligence. There follows a discussion of the broad issues involved in modelling time and constructing a temporal logic.
openaire +2 more sources