Advertisement

Extending BALM to Synchronous Equations Over co-Büchi Specifications

  • Tiziano Villa
  • Nina Yevtushenko
  • Robert K. Brayton
  • Alan Mishchenko
  • Alexandre Petrenko
  • Alberto Sangiovanni-Vincentelli
Chapter

Abstract

Suppose that we consider sequential synthesis problems where the objective is to find a strategy, implementable as a finite state machine (FSM), which guides a system to a given subset of states where at least one state is accepting and keeps it in that subset (e.g., the subset may include a winning state for a game, or a set of states with some desirable property). Such situations need ω-automata to capture these specifications. For instance, a useful property like liveness is expressed with Büchi automata.

Notes

Acknowledgements

This chapter grew out of a research project report by Guo Qiang Gerald Wang at UC Berkeley. Thanks to Orna Kupferman for extensive readings of a previous draft and suggesting the application to looping automata, and to Moshe Vardi for very useful comments.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Tiziano Villa
    • 1
  • Nina Yevtushenko
    • 2
  • Robert K. Brayton
    • 3
  • Alan Mishchenko
    • 4
  • Alexandre Petrenko
    • 5
  • Alberto Sangiovanni-Vincentelli
    • 4
  1. 1.Dipartimento D’InformaticaUniversità di VeronaVeronaItaly
  2. 2.Department of EECSTomsk State UniversityTomskRussia
  3. 3.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaBerkeleyUSA
  4. 4.Department of Electrical Engineering and Computer Science (EECS)University of California, BerkeleyBerkeleyUSA
  5. 5.Computer Research Institute of Montreal (CRIM)MontrealCanada

Personalised recommendations