The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] derive logic functions(3hit)

1-3hit
  • On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings

    Toshiyuki MIYAMOTO  Sadatoshi KUMAGAI  

     
    PAPER-Synthesis

      Vol:
    E80-D No:3
      Page(s):
    336-343

    Signal Transition Graphs (STG's) are Petri nets, which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on an Occurrence net (OCN) and its prefix, called an unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating sub state space of a given STG using the structural properties of OCN.

  • An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits

    Toshiyuki MIYAMOTO  Sadatoshi KUMAGAI  

     
    PAPER

      Vol:
    E79-A No:6
      Page(s):
    818-824

    Signal Transition Graphs (STG'S) [1] are Petrinets [2], which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.

  • An Efficient State Space Search for the Synthesis of Asynchronous Circuits by Subspace Construction

    Toshiyuki MIYAMOTO  Dong-Ik LEE  Sadatoshi KUMAGAI  

     
    PAPER

      Vol:
    E78-A No:11
      Page(s):
    1504-1510

    In this paper, an approach to derive a logic function of asynchronous circuits from a graph-based model called Signal Transition Graphs (STG) is discussed. STG's are Petri nets, whose transitions are interpreted as a signal transition on the circuit inputs or gate outputs, and its marking represents a binary state of the circuit. STG's can represent a behavior of circuit, to derive logic functions, however, the reachability graph should be constructed. In the verification of STG's some method based on Occurrence nets (OCN) and its prefix, called unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating substate space of a given STG using the structural properties of OCN. The proposed method can be seem as a parallel algorithm for deriving a logic function.