On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs

Authors:
Javier Esparza;Petr Jan!car;Alexander Miller
Affiliations:
Univ. Stuttgart, Germany;TU Ostrava, Czechia;Univ. Stuttgart, Germany
Venue:
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Year:
2006

Citing 0
Cited 3

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Efficient automatic resolution of encoding conflicts using STG unfoldings

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)

Quantified Score

Hi-index	0.00

Visualization

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 freechoice, bounded, and general STGs.