Advertisement

Implementation of Automata Manipulations

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

Abstract

In the following, we use the term transition to refer to a directed arc of an STG, which enables the movement of an automaton from the current state to the next state. The transition predicate indicates when the transition is enabled. A transition predicate is an arbitrary Boolean function in terms of the inputs. In some cases, this function is just a minterm. In this case, to avoid confusion, we will refer to a minterm transition.

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