Title :
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Author :
J. Esparza;P. Jancar;A. Miller
Author_Institution :
Univ. Stuttgart, Germany
fDate :
6/28/1905 12:00:00 AM
Abstract :
Signal transition graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general STGs
Keywords :
"Polynomials","Computer science","Asynchronous circuits","Petri nets","Cybernetics","Encoding","Computational complexity","Linear programming","Runtime","Sufficient conditions"
Conference_Titel :
Application of Concurrency to System Design, 2006. ACSD 2006. Sixth International Conference on
Print_ISBN :
0-7695-2556-3
DOI :
10.1109/ACSD.2006.17
