Verification, Model Checking, and Abstract Interpretation

Volume 7148 of the series Lecture Notes in Computer Science pp 283-298

Effective Synthesis of Asynchronous Systems from GR(1) Specifications

  • Uri KleinAffiliated withCourant Institute of Mathematical Sciences, New York University
  • , Nir PitermanAffiliated withDepartment of Computer Science, University of Leicester
  • , Amir PnueliAffiliated withCourant Institute of Mathematical Sciences, New York University

* Final gross prices may vary according to local VAT.

Get Access


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.