Results 1 
9 of
9
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.
Hierarchical correctness proofs for distributed algorithms
, 1987
"... Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example of how ..."
Abstract

Cited by 439 (66 self)
 Add to MetaCart
Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example of how itcan be used to construct such proofs. 1
Modal Logics and muCalculi: An Introduction
, 2001
"... We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchec ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchecking, and finally at the relationship of modal logics to other formalisms.
Specifying Communication in Distributed Information Systems
 Acta Informatica
, 1998
"... . In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specifica ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
. In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specification features that are not easy to implement. We show that D 1 specifications may be automatically translated to D 0 in a sound and complete way. In order to prove soundness and completeness, we define our translation as a simple map of institutions. Our result may be useful for making implementation platforms like Corba easier accessible by providing highlevel planning and specification methods for communication. 1 Introduction Two logics are presented that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers...
Specification and Refinement of Networks of Asynchronously Communicating Agents Using the Assumption/Commitment Paradigm
 FORMAL ASPECTS OF COMPUTING
, 1995
"... This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn. ffl We define two types of assumption/commitment specifications, namely simple and general specifi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn. ffl We define two types of assumption/commitment specifications, namely simple and general specifications. ffl It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. ffl We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoarelogic inspired. In particular the feedback rules employ invariants in the style of a traditional whilerule. ffl Both sets of rules have been proved to be sound and also (semantic) relative complete. ffl Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be i...
Assumption/Commitment Rules for Networks of Asynchronously Communicating Agents
, 1993
"... This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFOchannels in the tradition of [Kah74], [Kel78], [BDD + 92]: We define two different types of (explicit) assumption/commitment specific ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFOchannels in the tradition of [Kah74], [Kel78], [BDD + 92]: We define two different types of (explicit) assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoarelogic inspired. In particular the feedback rules employ an invariant in the style of a traditional whilerule. Both sets of rules have been proved to be sound and also semantically complete with respect to a chosen set of composition operators. Conversion rules allow the two logics to be combined. This means that general
Obligations and Dense Time for Specifying Deadlines
, 1998
"... In this paper we consider the notion of deadlines in the context of dense time. We show that obligations and actions are essential elements for the specification of deadlines. These notions can be relatively easy combined when a discrete temporal framework is used. However, we show that, once a dens ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we consider the notion of deadlines in the context of dense time. We show that obligations and actions are essential elements for the specification of deadlines. These notions can be relatively easy combined when a discrete temporal framework is used. However, we show that, once a dense time is introduced, several problems appear. In solving these problems we cannot use the same framework and definitions as used for the discrete time. In the new framework we use a branching dense temporal framework as a basis to specify both actions and obligations. Finally we show that all types of deadlines that were defined for the discrete temporal framework can also be defined for dense time.
Projection in Temporal Logic Programming 3
, 1995
"... We de ne a projection operator in the framework of the temporal logic programming. Its syntax and semantics are presented and illustrated with examples. We also discuss the implementation details of the projection construct. ..."
Abstract
 Add to MetaCart
(Show Context)
We de ne a projection operator in the framework of the temporal logic programming. Its syntax and semantics are presented and illustrated with examples. We also discuss the implementation details of the projection construct.
86 A Logical View of Composition
, 1992
"... DEC's business and technology objectives require a strong research program. ..."
Abstract
 Add to MetaCart
DEC's business and technology objectives require a strong research program.