Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Detecting State Coding Conflicts in STGs Using Integer Programming

Lookup NU author(s): Dr Victor Khomenko, Emeritus Professor Maciej KoutnyORCiD, Professor Alex YakovlevORCiD

Downloads

Abstract

The paper presents a new method for checking unique and complete state coding, the crucial conditions in the synthesis of asynchronous control circuits from signal transition graphs (STGs). The method detects state coding conflicts in an STG using its partial order semantics (unfolding prefix) and an integer programming technique. This leads to huge memory savings compared to methods based on reachability graphs, and also to significant speedups in many cases. In addition, the method produces execution paths leading to an encoding conflict. Finally, the approach is extended to checking the normalcy property of STGs, which is a necessary condition for their implementability using gales whose characteristic functions, are monotonic.

Publication metadata

Author(s): Khomenko V, Koutny M, Yakovlev A

Editor(s): Kloos, C.D., Franca, J.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Design, Automation and Test in Europe Conference and Exposition (DATE)

Year of Conference: 2002

Pages: 338-345

Publisher: IEEE Computer Society Press

URL: http://dx.doi.org/10.1109/DATE.2002.998295

DOI: 10.1109/DATE.2002.998295

Library holdings: Search Newcastle University Library for this item

ISBN: 0769514715

Share