On the synthesis of an asynchronous reactive module

  • Amir Pnueli
  • Roni Rosner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 372)

Abstract

We consider the synthesis of a reactive asynchronous module which communicates with its environment via the shared input variable x and the shared output variable y, assuming that the module is specified by the linear temporal formula ϕ(x,y). We derive from ϕ(x,y) another linear formula χ(r,w,x,y), with the additional scheduling variables r,w, and show that there exists a program satisfying ϕ iff the branching time formula (∀r,w,x)(∃y)Aχ(r,w,x,y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm, of doubly exponential time and space complexity, for constructing a program that implements the specification whenever it is implementable. In addition, we provide some matching lower bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Amir Pnueli
    • 1
  • Roni Rosner
    • 1
  1. 1.Department of Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations