seria: Lecture Notes in Control and Computer Science ; vol. 23

Wiśniewska, Monika

Zielonogórska Biblioteka Cyfrowa (Digital Library of Zielona Gora)

English

1 Averaged results of the research of the parallel decomposition .

1 Execution time for algorithms in relation to the number of SMCs . 100 A.1 Graphical representation of the Hippo system

1 Incidence matrix of a concurrency hypergraph for macronet MN1

1 Simpliﬁed controlling system of a speedway tournament

10 Results of the simulation for net PN2

10 Transversals of hypergraph H1

11 Example of hypergraph H1 coloring

11 Unordered coloring of graph G4

12 Final result for the random ordered coloring of graph G4

13 Incidence matrix of a dual hypergraph A∗

13 Result of LF order coloring of graph G4

14 Incidence matrix A2 for hypergraph H2

14 Results of the simulation of memory M1

15 Incidence matrix A2 after the ﬁrst reduction cycle

16 Reduced incidence matrix A2

17 Incidence matrix A2 after the reduction of vertex v6

2 Adjacency matrix of graph G2

2 Averaged results of the research of the structural decomposition .

2 Incidence matrix of a sequentiality hypergraph for macornet MN1

2 Incidence matrix of graph G1

20 Incidence matrix A3 after the reduction of vertices

22 Unordered coloring of hypergraph H4

23 Coloring of hypergraph H4 with randomly ordered vertices .

24 LF ordered coloring of hypergraph H4

25 SL ordered coloring of hypergraph H4

3 Adjacency matrix N2 of graph G2

3 Content of memory M1 after the reduction

3 Matrix AD of exact hypergraph

3 Neighborhood matrix of graph G1

3 Structural decomposition - a comparison of algorithms

4 Graph G1 (the complement of graph G1)

4 Incidence matrix of hypergraph HW1

4 Marking graph for macronet MN1

4 Marking graph for macronet MN2

5 Exemplary graph cover a) vertex cover b) edge cover

5 Incidence matrix of a concurrency graph for macronet MN1

5 Incidence matrix of hypergraph HW2

6 General model of a concurrent digital automaton

6 Incidence matrix of concurrency hypergraph HMN2

6 Vertex cover of graph G3

7 Graph G3 after the ﬁrst stage of the greedy algorithm

7 Incidence matrix of hypergraph H∗

7 Schematic diagram of an automaton with &quot;one-hot&quot; encoding .

8 Incidence matrix for hypergraph H1

8 Schematic diagram of an automaton with parallel encoding .

9 Incidence matrix AZ after the removal of vertex v1

9 Schematic diagram of a modular digital system

Incidence matrix A3 after the reduction of vertex v4

net PN2 controlling the machine for beverage production .

Reduction of the memory volume of microprogrammed controllers with usage of hypergraphs,

Application of hypergraphs in decomposition of discrete systems