1.
Carmona J, Cortadella J (2006) State encoding of large asynchronous controllers. In: DAC, pp 939–944
2.
Coudert O (1996) On solving covering problems. In: DAC, pp 197–202
3.
Gamelin T, Greene R Introduction to topology, Dover Publications, New York
4.
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of np-completeness. W.H. Freeman, New York
MATH
5.
Knuth D (2000) Dancing links. In: Millennial Perspectives in Computer Science, Palgrave, pp 187–214
6.
Korte B, Vygen J (2012) Combinatorial optimization: theory and algorithms, Springer New York
7.
Kovalyov A (1992) Concurrency relation and the safety problem for Petri nets. In: Jensen K (ed) Proceedings of the 13th International conference on application and theory of Petri nets 1992, LNCS, vol 616. Springer, pp 299–309, June 1992
8.
Pinter C (2014) A book of set theory, Dover Publications, New York
9.
Roguska A (2001) Evaluation of the practical interpreted Petri nets, grafcet networks and networks based on the SEC binary control system design, 2001. Bachelors Thesis, Technical University of Zielona Góra
10.
Rudell RL (1989) Logic synthesis for VLSI design. Ph.D. thesis, EECS Department, University of California, Berkeley, CA, USA
11.
Sentovich E, Singh KJ, Moon CW, Savoj H, Brayton RK, Sangiovanni-Vincentelli AL (1992) Sequential circuit design using synthesis and optimization. In: ICCD ’92: Proceedings of the 1991 IEEE international conference on computer design on VLSI in computer & processors, IEEE Computer Society, Washington, DC, USA, pp 328–333
12.
Silva M (2013) Half a century after Carl Adam Petri’s Ph.D. thesis: a perspective on the field. Annual Reviews in Control, vol 37(2). pp 191–219
13.
Silva M, Terue E, Colom JM (1998) Linear algebraic and linear programming techniques for the analysis of place/transition net systems, Springer, Berlin
14.
Stefanowicz Ł, Adamski M (2014) Aspects of selection of SM-components with the application of the theory of hypergraphs. In: Proceedings of the 7th IEEE international conference on human system interactions (HSI), Lisbon, Portugal, pp 221–226
15.
Stefanowicz L, Adamski M, Wiśniewski R (2013) Application of an exact transversal hypergraph in selection of SM-components. In: Technological innovation for the internet of things, Springer, Heidelberg-Dordrecht, pp 250–257
16.
Stefanowicz L, Adamski M, Wiśniewski R, Lipiński J (2014) Application of hypergraphs to SMCs selection. In: Technological innovation for collective awareness systems, Springer, pp 249–256
17.
Stoll R (1979) Set theory and logic. Dover Publications, New York
18.
Tkacz J, Adamski M (2012) Macrostate encoding of reconfigurable digital controllers from topological Petri net structure. Przeglad Elektrotechniczny 2012(8):137–140
19.
Valette R (1978) Comparative study of switching representation tool with GRAFCET and Petri nets. Nouv Autom 23(12):377–382
20.
Wiśniewska M (2012) Application of hypergraphs in decomposition of discrete systems, vol 23. Lecture Notes in Control and Computer ScienceUniversity of Zielona Góra Press, Zielona Góra
21.
Wiśniewska M, Adamski M, Wiśniewski R (2011) Exact transversals in decomposition of Petri nets into concurrent subnets. Meas Autom Monit 58(8):851–853 in Polish
22.
Wiśniewski R, Karatkevich A, Adamski M, Kur D (2014) Application of comparability graphs in decomposition of Petri nets. In: Proceedings of the 7th IEEE international conference on human system interactions (HSI), Lisbon, Portugal
23.
Wiśniewski R, Stefanowicz L, Wiśniewska M, Kur D (2015) Exact cover of states in the discrete state-space system. In: 11th international conference of computational methods in sciences and engineering (ICCMSE), vol 1702 of AIP Conference Proceedings Greece, Athens, pp 1–4
