Synchronous schemes and their decision problems

Authors:
Zohar Manna;Amir Pnueli
Affiliations:
Stanford University and Weizmann Institute of Science;Tel Aviv University
Venue:
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1980

Citing 5
Cited 1

On Ianov's Program Schemata

Journal of the ACM (JACM)
Theory of Program Structures: Schemes, Semantics, Verification

Theory of Program Structures: Schemes, Semantics, Verification
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Program schemas with equality

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
On the properties and applications of program schemas

On the properties and applications of program schemas

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of schemes called synchronous schemes is defined. A synchronous scheme can have several variables, but all the active ones are required to keep a synchronized rate of computation as measured by the height of their respective Herbrand values. A "reset" statement, which causes all the variables to restart a new computation, is admitted. It is shown that equivalence, convergence, and other properties are decidable for schemes in this class. The class of synchronous schemes contains, as special cases, the known decidable classes of Ianov schemes, one-variable schemes with resets, and progressive schemes.