Results 1 
4 of
4
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Automated Temporal Reasoning about Reactive Systems
, 1996
"... . There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective a ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
. There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective and reliable means of specifying and ensuring correct behavior of such systems. This paper discusses known complexity and expressiveness results for a number of such logics in common use and describes key technical tools for obtaining essentially optimal mechanical reasoning algorithms. However, the emphasis is on underlying intuitions and broad themes rather than technical intricacies. 1 Introduction There is a growing need for reliable methods of designing correct reactive systems. These systems are characterized by ongoing, typically nonterminating and highly nondeterministic behavior. Examples include operating systems, network protocols, and air traffic control systems. There is w...
Really Visual Temporal Reasoning
 In Proc. of IEEE RealTime Systems Symposium
, 1993
"... RealTime Future Interval Logic (RTFIL) is a visual logic with formulae that resemble timing diagrams. It is a dense realtime temporal logic that is based on two simple temporal primitives: interval modalities for the purely qualitative part and duration predicates for the quantitative part. In thi ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
RealTime Future Interval Logic (RTFIL) is a visual logic with formulae that resemble timing diagrams. It is a dense realtime temporal logic that is based on two simple temporal primitives: interval modalities for the purely qualitative part and duration predicates for the quantitative part. In this paper we present the logic, and illustrate its use in specifying the railroad crossing example and proving some of its properties. The logic in its propositional form is decidable by reduction to the emptiness problem of Timed Buchi Automata. A theorem prover, based on this decision procedure, has been implemented as part of a graphical proof environment. The proofs of the railroad crossing example have been verified using this theorem prover. The combination of an automated theorem prover and a graphical specification language greatly facilitate the task of verifying realtime proofs. This convenience apart, RTFIL is invariant under realtime stuttering and does not admit instantaneous st...
A RealTime Interval Logic and Its Decision Procedure
 In Proc. 13th Conf. Foundations of Software Technology and Theoretical Computer Science
, 1993
"... . RealTime Future Interval Logic is a visual logic in which formulae have a natural graphical representation, resembling timing diagrams. It is a dense realtime temporal logic that is based on two simple temporal primitives: interval modalities for the purely qualitative part and duration predicat ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
. RealTime Future Interval Logic is a visual logic in which formulae have a natural graphical representation, resembling timing diagrams. It is a dense realtime temporal logic that is based on two simple temporal primitives: interval modalities for the purely qualitative part and duration predicates for the quantitative part. We give a decision procedure for the logic by reduction to the emptiness problem for Timed Buchi Automata. The decision procedure forms the core of a proof checker for the logic that we have recently implemented. The logic does not admit instantaneous states, and is invariant under realtime stuttering. These properties facilitate proof methods based on abstraction and refinement. Two natural extensions of the logic lead to nonelementariness and undecidability. 1 Introduction Specifications of concurrent systems tend to be very complex. Much of this complexity stems from specifications that apply only in particular situations. Such specifications must define no...