A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs

Issue title: Application of Concurrency to System Design (ACSD'03)

Article type: Research Article

Authors: Esparza, Javier

Affiliations: Institute for Formal Methods in Computer Science, University of Stuttgart, Germany

Abstract: Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Deciding this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analizability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. This paper presents the first polynomial algorithm for checking consistency.

Journal: Fundamenta Informaticae, vol. 62, no. 2, pp. 197-220, 2004