Browse by author
Lookup NU author(s): Professor Alex Yakovlev
Obtaining a compact representation of the behaviour specified by Labelled Petri nets is an important part in verification of asynchronous circuit model at both abstract and logic synthesis levels. The paper outlines major problems of the application of the unfolding method to the bounded Petri nets. One of the possible ways of solving these problems is introduced. A new algorithm for verification of the behaviour specified by Signal Transition Graph is introduced and discussed.
Author(s): Semenov A, Yakovlev A
Publication type: Report
Publication status: Published
Series Title: Department of Computing Science Technical Report Series
Year: 1994
Pages: 18
Print publication date: 01/01/1994
Source Publication Date: 1994
Report Number: 487
Institution: Department of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/487.pdf
