Effective Synthesis of Asynchronous Systems from GR(1) Specifications

  • Uri Klein
  • Nir Piterman
  • Amir Pnueli
Conference paper

DOI: 10.1007/978-3-642-27940-9_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7148)
Cite this paper as:
Klein U., Piterman N., Pnueli A. (2012) Effective Synthesis of Asynchronous Systems from GR(1) Specifications. In: Kuncak V., Rybalchenko A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2012. Lecture Notes in Computer Science, vol 7148. Springer, Berlin, Heidelberg

Abstract

We consider automatic synthesis from linear temporal logic specifications for asynchronous systems. We aim the produced reactive systems to be used as software in a multi-threaded environment. We extend previous reduction of asynchronous synthesis to synchronous synthesis to the setting of multiple input and multiple output variables. Much like synthesis for synchronous designs, this solution is not practical as it requires determinization of automata on infinite words and solution of complicated games. We follow advances in synthesis of synchronous designs, which restrict the handled specifications but achieve scalability and efficiency. We propose a heuristic that, in some cases, maintains scalability for asynchronous synthesis. Our heuristic can prove that specifications are realizable and extract designs. This is done by a reduction to synchronous synthesis that is inspired by the theoretical reduction.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Uri Klein
    • 1
  • Nir Piterman
    • 2
  • Amir Pnueli
    • 1
  1. 1.Courant Institute of Mathematical SciencesNew York UniversityUSA
  2. 2.Department of Computer ScienceUniversity of LeicesterUK

Personalised recommendations