## METATEM: A Framework for Programming in Temporal Logic (1989)

Venue: | In REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (LNCS Volume 430 |

Citations: | 86 - 19 self |

### BibTeX

@INPROCEEDINGS{Barringer89metatem:a,

author = {Howard Barringer and Michael Fisher and Dov Gabbay and Graham Gough and Richard Owens},

title = {METATEM: A Framework for Programming in Temporal Logic},

booktitle = {In REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (LNCS Volume 430},

year = {1989},

pages = {94--129},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a concrete framework, called METATEM for executing (modal and) temporal logics. Our approach is illustrated by the development of an execution mechanism for a propositional temporal logic and for a restricted first order temporal logic.

### Citations

1176 | Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...guage G = fO, Sg, with one constant and one unary function. It utilises specific properties of this G (flow of time). Example --- Branching Time Temporal Logic There exist temporal logics such as CTL =-=[CES86]-=- that contain connectives of the form , which operate on the Herbrand universe of a set G of functions and have semantics: A is true at t iff for all paths p through t, there exists an x such that x >... |

334 | On the Synthesis of a Reactive Module - Pnueli, Rosner - 1989 |

292 |
A useful four-valued logic
- Belnap
- 1977
(Show Context)
Citation Context ... no conceptual framework within logic programming for allowing only those actions which have logical meaning. Some researchers have come close to touching upon the imperative reading of logic. Belnap =-=[Bel77]-=- and the later so-called data semantics school regard a formula j as generating an action on a model M, and changing it. In logic programming and deductive databases the handling of integrity constrai... |

235 |
Checking that finite state concurrent programs satisfy their linear specification
- Lichtenstein, Pnueli
- 1985
(Show Context)
Citation Context ... of states. A coarse bound can be given by the number of different states that appear in the semantic tableau for the program formula, f. This bound is 2 5|f| where |f| is the length of the formula f =-=[LP85]-=-. (Note that such a bound can not be established where arbitrary environment interaction occurs.) It can be shown that the execution mechanism described in Section 3.4 satisfies any satisfiable eventu... |

205 |
Automata-Theoretic Techniques for Modal Logics of Programs
- VARDI, WOLPER
- 1986
(Show Context)
Citation Context ...stencies have been carried out. 12 For an overview of the tableau method in propositional temporal logics, see Gough [Gou84] and Wolper [Wol85] and for an automata-theoretic view of this process, see =-=[VW86]-=-. 13 A Hintikka graph marked in this way is equivalent to a Buchi automaton. The execution mechanism proceeds by exploring a portion of the tree that can be generated from a Hintikka Graph in an attem... |

160 |
Synthesis of communicating processes from temporal logic specifications
- Manna, Wolper
- 1984
(Show Context)
Citation Context ...n the formal development of reactive systems has, in the main, been concentrated on techniques for specification and verification. The study of synthesis from temporal logic based specification, e.g. =-=[MW84]-=- and more recently [PR89a, PR89b], and, alternatively, the direct execution of temporal and modal logic, e.g. [Mos86] has not been so widespread, despite there being some fascinating starts. Currently... |

153 | Execution Temporal Logic Programs
- Moszkowski
- 1986
(Show Context)
Citation Context ... 180 Queen's Gate, London SW7 2BZ, UK. fdg,rpog@uk.ac.ic.doc Abstract. In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski =-=[Mos86]-=- and Gabbay [Gab87, Gab89] and present a concrete framework, called METATEM for executing (modal and) temporal logics. Our approach is illustrated by the development of an execution mechanism for a pr... |

91 |
The tableau method for temporal logic: An overview. Logique et Analyse
- Wolper
(Show Context)
Citation Context ...ble subtree' of the original tree in which no checks for inconsistencies have been carried out. 12 For an overview of the tableau method in propositional temporal logics, see Gough [Gou84] and Wolper =-=[Wol85]-=- and for an automata-theoretic view of this process, see [VW86]. 13 A Hintikka graph marked in this way is equivalent to a Buchi automaton. The execution mechanism proceeds by exploring a portion of t... |

78 | The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
- Gabbay
- 1987
(Show Context)
Citation Context ...ensure that it becomes true. Since the chronology of the action sequence and the model sequence are the same, we can virtually create the future model by our actions. The logic USF, defined by Gabbay =-=[Gab89]-=-, was the first attempt at promoting the imperative view as a methodology, with a proposal for its use as a language for controlling processes. 1.2 The METATEM Approach Work in the field of logic prog... |

62 |
On the synthesis of an asynchronous reactive module
- Pnueli, Rosner
- 1989
(Show Context)
Citation Context ...Hintikka Graphs. A similar approach to the `compilation' of METATEM program rules into automata is that of the synthesis of programs from reactive system specifications described by Pnueli and Rosner =-=[PR89b]-=-. As part of their work on the synthesis of reactive modules they synthesize, for finite systems with no environment interaction, Streett tree automata that are similar to the automata described above... |

48 | The power of temporal proofs - Abadi |

41 |
Reasoning about digital circuits
- Moszkowski
- 1983
(Show Context)
Citation Context ... [Mos86] has implemented a subset of a temporal logic, known as Tempura, based on interval models [MM84]. In fact, that particular interval temporal logic was first introduced for describing hardware =-=[Mos83]-=- and has now been put to the test with some examples of hardware simulation within Tempura [Hal87]. However, although Tempura is, in the computational sense, expressive enough, Tempura is limited in t... |

40 | Temporal-Logic Theorem Proving - Abadi - 1987 |

34 | Modal and temporal logic programming - Gabbay - 1987 |

31 | Temporal Logic Programming is Complete and Expressive - Baudinet - 1989 |

25 |
Decision procedures for temporal logic
- Gough
- 1984
(Show Context)
Citation Context ...he definition of validity is as in classical logic. Definition 2.2 A formula j is said to be valid, |= j, if and only if it is true for all models M ( M |= j). Theorem 2.1 PML is decidable. Proof See =-=[Gou84]-=-, for example. This is an important result. It means that algorithms can be constructed to determine the validity, or otherwise, of any given PML formula. 2.2 METATEM Programs and Execution A METATEM ... |

17 |
Temporal logic programming
- Hale
- 1987
(Show Context)
Citation Context ...[MM84]. In fact, that particular interval temporal logic was first introduced for describing hardware [Mos83] and has now been put to the test with some examples of hardware simulation within Tempura =-=[Hal87]-=-. However, although Tempura is, in the computational sense, expressive enough, Tempura is limited in the sense of logic programming as in Prolog. Concurrent with the development of Moszkowski's work, ... |

16 |
Reasoning in interval temporal logic
- Moszkowski, Manna
- 1983
(Show Context)
Citation Context ...st developed implementation of an executable temporal logic is that of Moszkowski and Hale. Moszkowski [Mos86] has implemented a subset of a temporal logic, known as Tempura, based on interval models =-=[MM84]-=-. In fact, that particular interval temporal logic was first introduced for describing hardware [Mos83] and has now been put to the test with some examples of hardware simulation within Tempura [Hal87... |

11 | Non-clausal temporal deduction - Abadi, Manna - 1985 |

7 | A timely resolution - Abadi, Manna - 1986 |

6 |
Implementing a prototype METATEM interpreter
- FISHER
- 1990
(Show Context)
Citation Context ...oral formulaseaten A . For example, all moments have fork AL and fork AR true, but the first two moments have eaten A false. The first few steps of a trace produced by a prototype METATEM interpreter =-=[Fis88]-=- are given in Figure 8. In the first step, the interpreter sets fork AL true but fork AR false. Since both forks have not been held by the philosopher for the last two moments, eaten A must be made fa... |

6 |
Temporal Prolog
- Sakuragawa
- 1986
(Show Context)
Citation Context ...ince occurred. In particular, Gabbay [Gab87, Gab89] who describes general execution models, Abadi et al. [AM85, AM86, Aba87b, Aba87a, Bau89] who investigate temporal resolution mechanisms, Sakuragawa =-=[Sak86] for a sim-=-ilar resolution-based "Temporal Prolog" and Hattori et al. [HNNT86] describe a modal logic based programming language for real-time process control, RACCO, based on Temporal Prolog. 2 Propos... |

2 |
RACCO: a modal-logic programming language for writing models of realtime process-control systems
- Hattori, Nakajima, et al.
- 1986
(Show Context)
Citation Context ...ecution models, Abadi et al. [AM85, AM86, Aba87b, Aba87a, Bau89] who investigate temporal resolution mechanisms, Sakuragawa [Sak86] for a similar resolution-based "Temporal Prolog" and Hatto=-=ri et al. [HNNT86]-=- describe a modal logic based programming language for real-time process control, RACCO, based on Temporal Prolog. 2 Propositional METATEM and its Execution In this section we illustrate the general p... |

1 |
Toward a Unified Logic Basis for Programming Languages
- Zhisong
- 1983
(Show Context)
Citation Context ...ever, although Tempura is, in the computational sense, expressive enough, Tempura is limited in the sense of logic programming as in Prolog. Concurrent with the development of Moszkowski's work, Tang =-=[Zhi83]-=- defined and implemented a low-level temporal (sequential) programming system XYZ/E. His logic is based upon a linear, discrete, future-time temporal logic. Recent developments in that area have been ... |