In: IEICE Transactions Information & Systems, Vol. E80-D, pages 336-343. March 1997.
Abstract: 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.
Keywords: signal transition graph, occurrence net, asynchronous circuit, derive logic functions, avoidance of state space explosion, speed independence.