Synthesizing FSMs According to Co-Büchi Properties

نویسندگان

  • Guoqiang Wang
  • Alan Mishchenko
  • Robert Brayton
  • Alberto Sangiovanni-Vincentelli
چکیده

Computations are developed for the synthesis of an FSM embedded in a known larger system such that the overall behavior satisfies a co-Büchi specification. The procedures for this are very similar to those used for regular (non-omega) automata, except for a special final step in which a set of FSM solutions is represented as a SAT instance. Each satisfying assignment corresponds to an FSM solution. To reduce the SAT size, a preprocessing step splits a general solution automaton into a “path” automaton and an “acceptance” automaton. Cycles in the path automaton graph are trimmed while maintaining the input -progressiveness property required for FSMs. Not all FSM solutions are represented by the SAT instance, since in theory there could be an infinite number. The computations have been implemented in the MVSIS environment and a few experiments have been done.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesizing to co-Büchi Properties

In this project, the computations of synthesis to co-Büchi properties are worked out. The procedures used to compute the most general solution is very similar to what has been used in regular automaton cases. The most general solution is turned to a particular solution by splitting it into a path automaton and an acceptance automaton. The cycles in the path automaton graph are trimmed while the...

متن کامل

Linear-Time Temporal Logic and Büchi Automata

Over the past two decades, temporal logic has become a very basic tool for specifying properties of reactive systems. For finite-state systems, it is possible to use techniques based on Büchi automata to verify if a system meets its specifications. This is done by synthesizing an automaton which generates all possible models of the given specification and then verifying if the given system refi...

متن کامل

GPU Acceleration of a Genetic Algorithm for the Synthesis of FSM-based Bimodal Predictors

This paper presents a fast GPU implementation of a genetic algorithm for synthesizing bimodal predictor FSMs of a given size. Bimodal predictors, i.e., predictors that make binary yes/no predictions, are ubiquitous in microprocessors. Many of these predictors are based on finite-state machines (FSMs). However, there are countless possible FSMs and even heuristic searches for finding good FSMs c...

متن کامل

Efficient Translation from Transition-Based Generalized Büchi Automata to Büchi Automata

The automata-theoretic approach is one of the state-of-the-art model-checking methods, which consists of the following steps: use a Büchi automaton to represent the abstract system model; use an LTL formula to express the properties to be verified; translate the negation of the LTL formula to a Büchi automaton and check whether the intersection of sentences accepted by the two automata is non-e...

متن کامل

Spinel-Type Cobalt Oxide (Co3O4) Nanoparticles from the mer- Co(NH3)3(NO2)3 Complex: Preparation, Characterization, and Study of Optical and Magnetic Properties

In this paper, the mer-Co(NH3)3(NO2)3 complex was used as a new precursor for synthesizing spinel-type cobalt oxide nanoparticles (Co3O4NPs).Thermal decomposition of the complex at low temperature (175 °C) resulted in the Co3O4NPs without using expensive and toxic solvents or complicated equipment. XRD, FT-IR, SEM, EDX, and TEM were employed to characterize the product, and its optical and magn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005