1.
Aho AV, Hopcroft JE (1974) The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co. Inc., Boston
MATH
2.
Barkaoui K, Minoux M (1992) A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. In: Proceedings of the 13th international conference on application and theory of Petri nets, Sheffield, UK, pp 62–75
3.
Best E (1987) Structural theory of Petri nets: the free choice hiatus. In: Lecture notes in computer science, vol 254, New York, 1987. Springer, pp 168–206
4.
Best E, Thiagarajan P (1987) Some classes of live and safe Petri nets. In: Voss K, Genrich H, Rozenberg G (eds) Concurrency and nets. Springer, Berlin, pp 71–94
CrossRef
5.
Blanchard M (1979) Comprendre., Matriser Et Appliquer Le GrafcetCepadues, Toulouse
6.
Commoner F, Holt AW, Even S, Pnueli A (1971) Marked directed graphs. J Comput Syst Sci 5(5):511–523
MathSciNetCrossRefMATH
7.
David R, Alla H (1992) Petri nets and grafcet: tools for modelling discrete event systems. Prentice-Hall Inc., Upper Saddle River
MATH
8.
David R, Alla H (2010) Discrete, continuous, and hybrid Petri nets, 2nd edn. Springer, Incorporated
CrossRefMATH
9.
Desel J, Esparza J (1995) Free choice Petri nets. Cambridge University Press, New York
CrossRefMATH
10.
Desel J, Neuendorf K-P, Radola M-D (1996) Proving nonreachability by modulo-invariants. Theoret Comput Sci 153(1&2):49–64
MathSciNetCrossRefMATH
11.
Diaz M (1987) Applying Petri net based models in the design of systems. In: Voss K, Genrich H, Rozenberg G (eds) Concurrency and nets. Springer, Heidelberg, pp 71–94
12.
Eiter T (1994) Exact transversal hypergraphs and application to boolean
\(\mu \)-functions. J Symbolic Comput 17(3):215–225
MathSciNetCrossRefMATH
13.
Esparza J, Silva M (1990) Top-down synthesis of live and bounded free choice nets. In: Applications and Theory of Petri Nets’90, pp 118–139
15.
Hack M (1974) Analysis of production schemata by Petri nets. MIT Project MAC TR-94 (1972) Corrections: Project MAC. Computation Structures Note 17
16.
Holt A, Commoner F (1970) Events and conditions: introduction. In: Dennis JB (ed) Record of the project MAC conference on concurrent systems and parallel computation. ACM, New York, pp 3–5
17.
Hu H, Zhou M, Li Z (2012) Liveness and ratio-enforcing supervision of automated manufacturing systems using Petri nets. IEEE Trans Syst Man Cybern Part A Syst Humans 42(2):392–403
CrossRef
18.
Johnson DS, Papadimitriou CH, Yannakakis M (1988) On generating all maximal independent sets. Inf Process Lett 27(3):119–123
MathSciNetCrossRefMATH
19.
Karatkevich A (2007) Dynamic analysis of Petri net-based discrete systems, vol 356, Lecture notes in control and information sciences. Springer, Berlin
20.
Karatkevich A, Wiśniewski R (2015) Relation between SM-covers and SM-decompositions of Petri nets. In: 11th International conference of computational methods in sciences and engineering (ICCMSE), volume 1702 of AIP conference proceedings, Greece, Athens, pp 1–4
21.
Kemper P (2004) O(
\(|P||T|\))-algorithm to compute a cover of S-components in EFC-nets
22.
Knuth DE (1997) The art of computer programming: fundamental algorithms, vol 1, 3rd edn. Addison Wesley Longman Publishing Co., Inc, Redwood City, CA, USA
23.
Kozlowski T, Dagless E, Saul J, Adamski M, Szajna J (1995) Parallel controller synthesis using Petri nets. IEE Proc Comput Dig Tech 142(4):263–271
CrossRef
24.
Lasota A (2012) Modeling of production processes with UML activity diagrams and Petri nets. PhD thesis, University of Zielona Góra
25.
Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77:548–580
CrossRef
26.
Papadimitriou HC (1994) Computational complexity. Addison Wesley
27.
Peterson JL (1981) Petri net theory and the modeling of systems. Prentice Hall PTR, Upper Saddle River
MATH
28.
Petri CA (1962) Kommunikation mit automaten. Bonn: Institut fr Instrumentelle Mathematik, Schriften des IIM Nr. 2
29.
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
30.
Rozenberg G, Engelfriet J (1998) Elementary net systems. In: Lectures on Petri nets I: basic models, advances in Petri nets, the volumes are based on the Advanced course on Petri nets, London, UK, 1998. Springer, pp 12–121
31.
Silva M (2013) Half a century after Carl Adam Petri’s Ph.D. thesis: a perspective on the field. Ann Rev Control, 37(2):191–219
32.
Sipser M (1996) Introduction to the theory of computation, 1st edn. International Thomson Publishing
33.
Valette R (1978) Comparative study of switching representation tool with GRAFCET and Petri nets. Nouv Autom 23(12):377–382
34.
Van Der Aalst W, Hee V (2004) Workflow management: models, methods, and systems. The MIT Press
35.
Wiśniewska M (2012) Application of hypergraphs in decomposition of discrete systems, vol 23, Lecture notes in control and computer science. University of Zielona Góra Press, Zielona Góra
36.
Wiśniewski R, Grobelna I, Grobelny M, Wiśniewska M (2015) Design and verification of distributed logic controllers with application of Petri nets. In: 11th international conference of computational methods in sciences and engineering (ICCMSE), volume 1702 of AIP conference proceedings, Greece, Athens, pp 1–4
37.
Wiśniewski R, Stefanowicz Ł, Bukowiec A, Lipiński J (2014) Theoretical aspects of Petri nets decomposition based on invariants and hypergraphs. Lecture notes in electrical engineering, vol 308. Zhangjiajie, China, pp 371–376
38.
Wiśniewski R, Grobelna I, Stefanowicz L (2016) Partial reconfiguration of concurrent logic controllers implemented in FPGA devices. In: 12th international conference of computational methods in sciences and engineering—ICCMSE’16, page TBD, Athens, Greece. Accepted for publication
39.
Yakovlev A, Gomes L, Lavagno L (2000) Hardware design and Petri nets. Springer
40.
Zakrevskij A, Pottosin Y, Cheremisinova L (2009) Design of logical control devices. TUT Press, Moskov
