On the complexity of consistency and complete state coding for signal transition graphs

DSpace/Manakin Repository

aaK citaci nebo jako odkaz na tento záznam použijte identifikátor: http://hdl.handle.net/10084/70972

Show simple item record


dc.contributor.author Esparza, Javier
dc.contributor.author Jančar, Petr
dc.contributor.author Miller, Alexander
dc.date.accessioned 2009-02-02T08:18:50Z
dc.date.available 2009-02-02T08:18:50Z
dc.date.issued 2008
dc.identifier.citation Fundamenta informaticae. 2008, vol. 86, no 3, p. 227-253. en
dc.identifier.issn 0169-2968
dc.identifier.issn 1875-8681
dc.identifier.uri http://hdl.handle.net/10084/70972
dc.description.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. en
dc.language.iso en en
dc.publisher IOS Press en
dc.relation.ispartofseries Fundamenta informaticae en
dc.relation.uri http://iospress.metapress.com/content/t23t14252170/ en
dc.subject signal transition graphs en
dc.subject consistency en
dc.subject complete state coding en
dc.subject Petri nets en
dc.subject complexity en
dc.title On the complexity of consistency and complete state coding for signal transition graphs en
dc.type article en
dc.identifier.location Není ve fondu ÚK en
dc.identifier.wos 000262367600002

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Navigation

Browse

My Account

Statistics