Results 1 
3 of
3
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...
A Dataflow Semantics for Constraint Logic Programs
 In Proceedings of PLILP'95
, 1995
"... . This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics T . Next, an equivalent fixpoint semantics F is defined: a dataflow graph is assigned to a program, and a consequence operator ..."
Abstract
 Add to MetaCart
. This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics T . Next, an equivalent fixpoint semantics F is defined: a dataflow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least fixpoint determines one set of constraints for each node of the dataflow graph. To prove that F and T are equivalent, an intermediate semantics O is used, which propagates a given set of constraints through the paths of the dataflow graph. Possible applications of F (and O) are discussed: in particular, its incrementality is used to define a parallel execution model for clp's based on asynchronous processors assigned to the nodes of the program graph. Moreover, O is used to formalize the Intermittent Assertion Method of Burstall [Bur74] for constraint logic programs. 1 Introduction In this paper a dataflow semantics for constraint logic...