|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 3 of 6 found articles
| Title: |
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs |
| Author: |
Esparza, Javier Jančar, Petr Miller, Alexander |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 86 (2008) nr. 3 pages 227-253 |
| Year: |
2008-12-16 |
| Contents: |
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. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 3 of 6 found articles
| << previous | next >> |