Application of hypergraphs in microcode length reduction of microprogrammed controllers

Wiśniewska, M.; Adamski, Marian; Wiśniewski, Remigiusz; Halang, Wolfgang A.

doi:10.1109/inds.2009.5227987

Cited by 6 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The application of Petri nets in the modelling of concurrent machines facilitates the process of the subsequent analysis since it is a tool widely used by researchers throughout the world [1][2][3][7][8][9][10][11][12][13][14]. In view of the fact that the relationship between the size of the net and the number of states is generally exponential, the decomposition, and thus the analysis, can be very difficult.…”

Section: Problem Formulationmentioning

confidence: 99%

Aspects of selection of SM Components with the application of the theory of hypergraphs

Stefanowicz

Adamski

2014

2014 7th International Conference on Human System Interactions (HSI)

View full text Add to dashboard Cite

The paper discusses various aspects of selection of State Machine Components of a Petri net with the application of the theory of hypergraphs. First, the idea of selection of SM Components utilising the hypergraph apparatus is presented, then some examples of the exact transversal method, which has been successfully introduced as one of the alternative methods next to the exact algorithms (e.g. backtracking algorithm) that are commonly applied or approximate algorithms (e.g. greedy algorithm). The selection of subnets, which is essential for decomposition, is an NP-hard problem. In addition to the theoretical aspects, the article also presents the experimental research conducted in two phases. The first phase was designed to determine the effect of reduction, called Cyclic-Core, on the type of the selection hypergraph, on the basis of which the exact solution is later determined. The second part of the study deals with the efficiency and effectiveness of the exact transversal method, which provides a reference point, in comparison to the backtracking algorithm. The article has been complemented with a decent summary which includes: the issues discussed, the results of research, as well as references to the further stages of research.

show abstract

Section: Problem Formulationmentioning

confidence: 99%

Aspects of selection of SM Components with the application of the theory of hypergraphs

Stefanowicz

Adamski

2014

2014 7th International Conference on Human System Interactions (HSI)

View full text Add to dashboard Cite

show abstract

“…Nodes and edges are the key elements of any graph data model. There are several graph data models such as a simple property graph model [24], a Resource Description Framework graph model [25], and a hypergraph model [26]. In a simple property graph model, a single node represents one real-world entity of interest, e.g.…”

Section: Chapter 1 Introductionmentioning

confidence: 99%