Zobrazit minimální záznam

dc.contributor.authorEsparza, Javier
dc.contributor.authorJančar, Petr
dc.contributor.authorMiller, Alexander
dc.date.accessioned2009-02-02T08:18:50Z
dc.date.available2009-02-02T08:18:50Z
dc.date.issued2008
dc.identifier.citationFundamenta informaticae. 2008, vol. 86, no 3, p. 227-253.en
dc.identifier.issn0169-2968
dc.identifier.issn1875-8681
dc.identifier.urihttp://hdl.handle.net/10084/70972
dc.description.abstractSignal 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.isoenen
dc.publisherIOS Pressen
dc.relation.ispartofseriesFundamenta informaticaeen
dc.relation.urihttp://iospress.metapress.com/content/t23t14252170/en
dc.subjectsignal transition graphsen
dc.subjectconsistencyen
dc.subjectcomplete state codingen
dc.subjectPetri netsen
dc.subjectcomplexityen
dc.titleOn the complexity of consistency and complete state coding for signal transition graphsen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.wos000262367600002


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam