In: Proc. of Advanced Research in Asynchronous Circuits and Systems, 18-21 March 1996, Aizu-Wakamatsu, Japan, pages 30-35. March 1996.
Also in: IEICE Transactions Fundamentals, Vol. E79-A, pages 818-824. June 1996.
Abstract: Signal Transition Graph s(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 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.
Keywords: signal transition graph, occurrence net, asynchronous circuit, derive logic functions, avoidance of state space explosion.