Skip to Main content Skip to Navigation
Conference papers

Application of Hypergraphs to SMCs Selection

Abstract : The paper deals with selection of State Machine Components (SMCs) based on Hypergraphs theory. The entire selection process use Petri nets as benchmarks. As it is known, Petri nets are used for modeling of concurrency processes. The SMCs selection problem is classified as NP-Hard which means there does not exist polynomial algorithm which provides an exact solution. In the article we show three SMCs selection methods, advantages and disadvantages of each, results of comparison between traditional methods (exponential backtracking, polynomial greedy) and an exact transversal method based on hypergraphs theory, their efficiency and propriety. An exact transversal method allows to obtain exact solution in polynomial time if selection hypergraph belongs to xt-hypergraph class.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01274781
Contributor : Hal Ifip <>
Submitted on : Tuesday, February 16, 2016 - 11:20:19 AM
Last modification on : Thursday, May 12, 2016 - 10:38:06 AM
Document(s) archivé(s) le : Saturday, November 12, 2016 - 10:18:07 PM

File

978-3-642-54734-8_28_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Łukasz Stefanowicz, Marian Adamski, Remigiusz Wiśniewski, Jakub Lipiński. Application of Hypergraphs to SMCs Selection. 5th Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS), Apr 2014, Costa de Caparica, Portugal. pp.249-256, ⟨10.1007/978-3-642-54734-8_28⟩. ⟨hal-01274781⟩

Share

Metrics

Record views

83

Files downloads

242