Results 1 
5 of
5
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
(Show Context)
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...
From church and prior to psl
 In O. Grumberg & H. Veith (Eds.), 25 Years of Model Checking
, 2008
"... Abstract. One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrialstandard propertyspecification language called PSL. This development was enabled by the equally unlikely transformati ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract. One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrialstandard propertyspecification language called PSL. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for secondorder arithmetics, into effective algorithms for modelchecking tools. This paper attempts to trace the tangled threads of this development.
Towards an AutomataTheoretic Counterpart of Combined Temporal Logics
 In Proceedings of the International Workshop on Verification and Computational Logic
, 2001
"... In this paper, we define a new class of combined automata, called temporalized automata, which can be viewed as the automatatheoretic counterpart of temporalized logics, and show that relevant properties, such as closure under Boolean operations, decidability, and expressive equivalence with respec ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we define a new class of combined automata, called temporalized automata, which can be viewed as the automatatheoretic counterpart of temporalized logics, and show that relevant properties, such as closure under Boolean operations, decidability, and expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones. Furthermore, we successfully apply temporalized automata to provide the full secondorder theory of krefinable downward unbounded layered structures with a temporal logic counterpart. Finally, we show how temporalized automata can be used to deal with relevant classes of reactive systems, such as granular reactive systems and mobile reactive systems.
Temporal Modalities for Concisely Capturing Timing Diagrams
"... Abstract. Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both partial orders on events and don’tcare regions to LTL potentially yields exponentially larger formulas containing ..."
Abstract
 Add to MetaCart
Abstract. Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both partial orders on events and don’tcare regions to LTL potentially yields exponentially larger formulas containing several nonlocalized terms corresponding to the same event. This raises a more fundamental question: which modalities allow a textual temporal logic to capture such diagrams using a single term for each event? We define the shapes of partial orders that are captured concisely by a hierarchy of textual linear temporal logics containing future and past time operators, as well Laroussinie et al’s forgettable past operator and our own unforeseen future operator. Our results give insight into the temporal abstractions that underlie timing diagrams and suggest that the abstractions in LTL are significantly weaker than those captured by timing diagrams. 1