Synthesis of reactive(1) designs

  • Authors:
  • Nir Piterman;Amir Pnueli;Yaniv Sa'ar

  • Affiliations:
  • EPFL – I&C – MTC, Lausanne, Switzerland;Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel;Department of Computer Science, Ben Gurion University, Beer-Sheva, Israel

  • Venue:
  • VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of synthesizing digital designs from their ltl specification. In spite of the theoretical double exponential lower bound for the general case, we show that for many expressive specifications of hardware designs the problem can be solved in time N3, where N is the size of the state space of the design. We describe the context of the problem, as part of the Prosyd European Project which aims to provide a property-based development flow for hardware designs. Within this project, synthesis plays an important role, first in order to check whether a given specification is realizable, and then for synthesizing part of the developed system.