Application of Hypergraphs to SMCs Selection - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Application of Hypergraphs to SMCs Selection

(1) , (1) , (1) , (1)
1
Łukasz Stefanowicz
  • Function : Author
  • PersonId : 976773
Marian Adamski
  • Function : Author
  • PersonId : 976774
Remigiusz Wiśniewski
  • Function : Author
  • PersonId : 976775
Jakub Lipiński
  • Function : Author
  • PersonId : 976776

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.
Fichier principal
Vignette du fichier
978-3-642-54734-8_28_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01274781 , version 1 (16-02-2016)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Ł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⟩
35 View
114 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More