Dynamic analysis of petri net-based discrete systems

Lecture Notes in Control and Information Sciences

Volumn 356, Issue , 2007, Pages 1-166

  Karatkevich, Andrei ^a  

^a UNIVERSITY OF ZIELONA GÓRA   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC ANALYSIS;

DISCRETE SYSTEMS; DYNAMICS ANALYSIS;

PETRI NETS;

EID: 34547295044     PISSN: 01708643     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-71560-3     Document Type: Article

References (253)

1. P. A. Abdulla, S. P. Iyer, and A. Nylén. Unfoldings of unbounded Petri nets. In Proceedings of the International Workshop on Computer Aided Verification, pages 495-507, 2000.
2. P. A. Abdulla, B. Jonsson, M. Kindahl, and D. Peled. A general approach to partial order reductions in symbolic verification (extended abstract). In Proceedings of the International Workshop on Computer Aided Verification, pages 379-390, 1998.
3. M. Adamski. Realizacja, sieci Petri z wykorzystaniem PLA. In Krajowa Konf. Teoria Obwodów i Układy Elektroniczne, pages 455-459, 1981.
4. M. Adamski. Projektowanie układów cyfrowych aystematyczna metoda strukturalna. Wyzsza Szkoła Inzynierska, w Zielonej Górze, 1990.
5. M. Adamski. Parallel controller implementation using standard PLD software. In FPGAs : International Workshop on Field Programmable. Logic and Applications, pages 296-304. Abingdon EE&CS Books, 1991.
6. M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors. Design of Embedded Control Systems. Springer-Verlag, New York, 2005.
7. M. Adamski, J. L. Monteiro, W. Fengler, and A. Wendt. A distributed Petri netbased discrete controller system. In Proceedings of the Conference on Automatic Control - Control'96, volume 2, pages 777-782, Oporto, 1996.
8. M. Adamski and M. Wȩgrzyn. Field programmable implementation of concurrent state machine. In Computer - Aided Design of Discrete Devices: Proceedings of the International Conference, volume 1, pages 4-12, Minsk, 1999.
9. M. Adamski, M. Wȩgrzyn, and P. Wolanski. A VHDL based approach to logic controllers design. In Proc. of Int. Conference Programmable Devices and Systems, pages 9-16, 1998.
10. R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Partial-order reduction in symbolic state space exploration. In Proceedings of the International Workshop on Computer Aided Verification, Lecture Notes in Computer Science 1254, pages 340-351. Springer-Verlag, 1997.
11. G. Andrzejewski. Hierarchical Petri nets as a representation of reactive behaviors. In Proceedings of the International Conference on Applied Computer Systems, volume 2, pages 145-154, Szczecin, Poland, 2001.
12. G. Andrzejewski. Programowy model interpretowanej sieci Petriego dla potrzeb projektowania mikrosystemów cyfrowych. PhD thesis, Uniwersytet Zielonogorski, 2003.
13. G. Andrzejewski. Hierarchical Petri nets for digital controller design. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 27-36. Springer-Verlag, New York, 2005.
14. G. Andrzejewski and A. Karatkevich. Interpreted Petri nets in system design. In Proceedings of the 10th International Conference on Machine-Building and Technosphere in XXI Century, volume 4, pages 7-10, Donetsk, Ukraine, 2003.
15. G. Andrzejewski and A. Karatkevich. Program model of hierarchical Petri net. In Proc. of the 2nd International Workshop on Discrete - Event System Design, DESDes 04, pages 9-14, Dychów, Polska, 2004.
16. G. Andrzejewski and A. Karatkevich. Interpreted hierarchical Petri nets in digital controller design. Radioelektronika i Informatika, (1):74-79, 2005.
17. M. Auguin, F. Boeri, and C. Andre. Systematic method of realization of interpreted Petri nets. Digital Processes, (6):55-68, 1980.
18. F. Balarin, editor. Hardware-Software Co-Design of Embedded Systems. The POLIS Approach. Kluwer Academic Publishers, 1997.
19. Z. Banaszak, J. Kuś, and M. Adamski. Sieci Petriego. Modelowanie, sterowanie i synteza systemów dyskretnych. Wyższa Szkoła Inżynierska, Zielona Gora, 1993.
20. J. Baranowski. Metody syntezy układów cyfrowych opisanych sieciź Petri. PhD thesis, Politechnika Ślź ska, Gliwice, 1982.
21. K. Barkaoui and M. Minoux. 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, Lecture Notes in Computer Science, volume 616, pages 62-75. Springer-Verlag, 1992.
22. B. Baumgarten. Petri-Netze: Grundlagen und Anwendungen. Spektrum, Akad. Verlag, 1996.
23. H. Belhadj, L. Gerbaux, M. Bertrand, and G. Saucier. Proc. of the IFIP WG10.2/WG10.5 Workshops on Specification and synthesis of communicating finite state machines. In Synthesis for Control Dominating Circuits, pages 91-102. Elsevier, North-Holland, 1993.
24. G. Berthelot. Checking properties of nets using transformation. In Advances in Petri Nets'85, Lecture Notes in Computer Science, volume 222, pages 19-40. Springer-Verlag, 1986.
25. G. Berthelot and C. Roucairol. Reduction of petri nets. In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, volume 45, pages 202-209. Springer-Verlag, Berlin, 1976.
26. G. Berthelot, C. Roucairol, and R. Valk. Reduction of nets and parallel programs. In Lecture Notes in Computer Science, volume 84, pages 277-290. Springer-Verlag, 1980.
27. E. Best. Petri net semantics of priorities. In Extended Abstracts of Concurrency and Compositability, pages 11-14, S. Miniato, 1990.
28. E. Best, L. Cherkasova, J. Desel, and J. Esparza. Characterisation of home states in free choice systems. In Semantics for Concurrency. Proceedings of the International BCS-FACS Workshop, pages 16-20, London, UK, 1990. Springer-Verlag.
29. E. Best and J. Desel. Partial order behaviour and structure of Petri nets. Formal Aspects of Computing, 2:123-138, 1990.
30. E. Best and M. Koutny. Petri net semantics of priority systems. Theoretical Computer Science, (96):175-215, 1992.
31. G. Bhat and D. Peled. Adding partial orders to linear temporal logic. In Proceedings of the 8th International Conference CONCUR'97, Lecture Notes in Computer Science, volume 1243, pages 119-134, Berlin, Germany, July 1997. Springer-Verlag.
32. J. Bieganowski and A. Karatkevich. Heurystyki dla metody Thelena obliczania implikantów prostych. In Materiaty IV Krajowej konferencji Metody i systemy komputerowe w badaniach naukowych i projektowaniu inzynierskim, MSK'03, pages 71-76, Kraków, 2003.
33. J. Bieganowski and A. Karatkevich. Heuristics for Thelen's prime implicant method. Schedae Informaticae, 14:125-135, February 2005.
34. K. Bilinski. Application of Petri Nets in Parallel Controllers Design. PhD thesis, University of Bristol, 1996.
35. K. Bilinski, M. Adamski, J. Saul, and E. Dagless. Petri-net-based algorithms for parallel-controller synthesis. IEE Proceedings - Computers and Digital Techniques, 141(6):405-412, 1994.
36. G. Bruno, A. Castella, G. Macario, and M. P. Pescarmona. Scheduling hard real-time systems using high-level Petri nets. In Application and Theory of Petri Nets 1992, Lecture Notes in Computer Science, volume 616, pages 93-112. Springer-Verlag, 1992.
37. P. Buchholz. Hierarchical high level Petri nets for complex system analysis. In Valette, R., editor, Application and Theory of Petri Nets 1994, Proceedings of 15th International Conference, Zaragoza, Spain, Lecture Notes in Computer Science, volume 815, pages 119-138. Springer-Verlag, 1994.
38. L. D. Cheremisinova. Minimization of finite-response sequential automata, that implement parallel logical control algorithms. Automatic Control and Computer Sciences, 22(4):69-74, 1988.
39. L. D. Cheremisinova. Software and hardware implementation of PRALU-algorithms. In Logical Control, volume 6, pages 88-105, Minsk, 2001. Institute of Engineering Cybernetics of NANB. (in Russian).
40. L. D. Cheremisinova. Implementation of Parallel Logical Control Algorithms. Institute of Engineering Cybernetics of NANB, Minsk, 2002. (in Russian).
41. L. D. Cheremisinova. Optimal state assignment of asynchronous parallel automata. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 125-137. Springer-Verlag, New York, 2005.
42. L. D. Cheremisinova and Yu. V. Pottosin. Assignment of partial states of a parallel synchronous automaton. In Proceedings of the International Conference on Computer-Aided Design of Discrete Devices, pages 85-88, Minsk-Szczecin, 1995.
43. S. Christensen and N. D. Hansen. Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. In Proceedings of the 14th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, volume 691, pages 186-205, London, UK, 1993. Springer-Verlag.
44. E. M. Clarke, O. Grumberg, M. Minea, and D. A. Peled. State space reduction using partial order techniques. STTT, 2(3):279-287, 1999.
45. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, Cambridge, USA, 1999.
46. A. Classen. Modulare Statecharts: Ein formaler Rahmen zur hierarchischen Processspezifikation. Lehrstuhl für Informatik II, Aachen University of Technology, M.Se. Thesis, Germany, 1993.
47. J. M. Colom, J. Campos, and M. Silva. On liveness analysis through linear algebraic techniques. In Proceedings of Design Methods Based on Nets, Esprit Basic Research Action 3148, W.G. 6, Deliverables Covering the Period June 1989 to June 1990, Paris, 1990.
48. T. H. Cormen, Ch. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1994.
49. O. Coudert and J. K. Madre. New ideas for solving covering problems. In Proceedings of the Design Automation Conference, DAC'95, pages 641-646, 1995.
50. O. Coudert, J. K. Madre, and H. Fraisse. A new viewpoint on two-level logic minimization. In Proceedings of the Design Automation Conference, DAC'93, pages 625-630, 1993.
51. R. David and H. Alla. Petri Nets and Grafcet. Tools for Modelling Discrete Event Systems. Prentice-Hall, New York, 1992.
52. J. Davis, C. Hylands, J. Janneck, E. A. Lee, et al. Overview of the Ptolemy Project. Technical Memorandum UCB/ERL M01/11, Berkeley, March 2001.
53. N. Deo. Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, New Jersey, 1974.
54. J. Desel. A proof of the rank theorem for extended free choice nets. In Applications and Theory of Petri Nets 1992, Lecture Notes in Computer Science, volume 616, pages 134-153. Springer-Verlag, 1992.
55. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
56. D. Drusinsky and D. Harel. Using Statecharts for hardware description and synthesis. IEEE Transactions on Coputer-Aided Design, 8(7):798-807, July 1989.
57. J. Esparza. Model checking using net unfoldings. In Proceedings of TAPSOFT '93, Lecture Notes in Computer Science, volume 668, pages 613-628. Springer-Verlag, 1993.
58. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proceedings of 10th International Conference on Concurrency Theory, Eindhoven, Lecture Notes in Computer Science, volume 1664, pages 2-20. Springer-Verlag, August 1999.
59. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In 2nd TACAS, LNCS 1055, pages 87-106. Springer-Verlag, 1996.
60. J. Esparza and M. Silva. On the analysis and synthesis of free choice systems. In Advances in Petri Nets 1990, Lecture Notes in Computer Science, volume 483, pages 243-286, Berlin, Germany, 1991. Springer-Verlag.
61. J. Esparza and M. Silva. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theor. Computer Science, 102(1):185-205, 1992.
62. R. Esser. An Object Oriented Petri Net Approach to Embedded Systems Design. PhD thesis, Swiss Federal Institut of Technology, Zürich, 1996.
63. P. C. McGeer et al. Espresso-Signature: a new exact minimizer for logic functions. In Proceedings of the Design Automation Conference, DAC'93, pages 618-624, 1993.
64. R. K. Brayton et al. VIS: a system for verification and synthesis. In Proceedings of the Conference on Computer-Aided Verification, CAV'96, Lecture Notes in Computer Science, volume 1102, pages 332-334. Springer-Verlag, August 1996.
65. J. Ezpeleta, J. M. Colom, and J. Martinez. A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics and Automation, 11(2):173-184, 1995.
66. J. Ezpeleta, J. M. Couvreur, and M. Silva. A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri Nets. In Advances in Petri Nets 1993, Lecture Notes in Computer Science, volume 674, pages 126-147. Springer-Verlag, 1993.
67. W. Fengler, A. Wendt, M. Adamski, and J. L. Monteiro. Petri net based program design and implementation for controller systems. In Proceedings of 1996 IFAC Triennial World Congress, volume 1, pages 425-429, San Francisco, USA, 1996.
68. J. Fernandes, M. Adamski, and A. Proença. VHDL generation from hierarchical Petri net specifications of parallel controllers. IEE Proceedings - Computers and Digital Techniques, 144(2):127-137, 1997.
69. A. Ferrari. JPVM: network parallel computing in Java. Concurrency: Practice and Experience, 10(11-13):985-992, 1998.
70. L. Ferrarini. An incremental approah to logic controller design with Petri nets. IEEE Transactions on System, Man and Cybernetics, 22(3):461-474, 1992.
71. D. D. Gajski, F. Vahid, S. Narayan, and J. Gong. Specification and Design of Embedded Systems. Prentice-Hall, 1994.
72. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine. A Users' Guide and Tutorial for Networked Parallel Computing. Massachusetts Institute of Technology Press, 1994.
73. A. Gill. Introduction to the Theory of Finite-state Machines. McGraw-Hill, New York, 1962.
74. C. Girault and R. Valk. Petri Nets for Systems Engineering. A Guide to Modeling, Verification, and Application. Springer-Verlag, Berlin Heidelberg, 2003.
75. V. M. Glushkov. Synthesis of Digital Automata. Fizmatgiz, Moscow, 1962. (in Russian).
76. P. Godefroid. Using partial orders to improve automatic verification methods. In Proceedings of the 2nd International Workshop on Computer Aided Verification CAV '90, Lecture Notes in Computer Science, volume 531, pages 176-185. Springer-Verlag, 1991.
77. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem, LNCS, volume 1032. Springer-Verlag, New York, USA, 1996.
78. P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods (extended abstract). In Proceedings of the 5th International Conference on Computer Aided Verification, CAV '93, LNCS, volume 697, pages 438-449, London, UK, 1993. Springer-Verlag.
79. L. Gomes, J. P. Barros, and A. Costa. Structuring mechanisms in Petri net models. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 153-166. Springer-Verlag, 2005.
80. V. S. Grigoryev, A. D. Zakrevskij, and V. A. Perchuk. The sequent model of the discrete automaton. In Vychislitelnaya Tekhnika v Mashinostroenii, pages 147-153. Institute of Engineering Cybernetics, Minsk, March 1972. (in Russian).
81. A. Gurel, O. C. Pastravanu, F. L. Lewis, and A. Doganalp. Deadlock avoidance using a (min,+) matrix model for flexible manufacturing systems. In Proceedings of the 4th Workshop on Discrete Event Systems, Cagliari, Italy, 1998.
82. M. Hack. Analysis of Production Schemata by Petri Nets. MIT Project MAC TR-94,1972. Corrections: Project MAC, Computation Structures Note 17 (1974).
83. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
84. J. Hartmann, M. Vieira, H. Foster, and A. Ruder. A UML-based approach to system testing. Innovations in Systems and Software Engineering, 1:12-24, 2005.
85. M. Heiner. Verification and optimization of control programs by Petri nets without state explosion. In Proceedings of the 2nd International Workshop on Manufacturing and Petri Nets held at the International Conference on Application and Theory of Petri Nets, ICATPN '97, Toulouse, June 1997, pages 69-84, 1997.
86. M. Heiner. Petri net based system analysis without state explosion. In Proceedings of High Performance Computing, Boston, April 1998, pages 394-403, San Diego, 1998.
87. K. Heljanko, V. Khomenko, and M. Koutny. Parallelisation of the Petri Net Unfolding Algorithm. Technical Report CS-TR-733, University of Newcastle upon Tyne, 2001.
88. B. Hnatkowska, and Z. Huzar. Transformation of dynamic aspects of UML models into LOTOS behaviour expressions. Applied Mathematics and Computer Science, 11(2):537-556, 2001.
89. G. J. Holzmann. Design and validation of computer protocols. Prentice-Hall, Upper Saddle River, NJ, USA, 1991.
90. G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
91. J. E. Hopcroft and J. D. Ulman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
92. Yi. Huang, M. Jeng, X. Xie, and S. Chung. A deadlock prevention policy for flexible manufacturing systems using siphons. In Proceedings of IEEE International Conference on Robotics and Automation, 2001, volume 1, pages 541-546, 2001.
93. P. Huber, A. M. Jensen, L. O. Jensen, and K. Jensen. Towards reachability trees for high-level Petri nets. In Advances in Petri Nets 1984, Lecture Notes in Computer Science, volume 188, pages 215-233. Springer-Verlag, 1985.
94. Th. Hummel and W. Fengler. Design of embedded control systems using hybrid Petri nets. In Proceedings of the International Workshop on Discrete - Event System Design, pages 189-194, Przytok k/Zielonej Gory, Poland, 2001.
95. Th. Hummel and W. Fengler. Design of embedded control systems using hybrid Petri nets and time interval Petri nets. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 141-151, New York, 2005. Springer-Verlag.
96. R. Janicki and M. Koutny. On Some Implementation of Optimal Simulation. Technical Report 90-07, McMaster University, Hamilton, Ontario, 1990.
97. R. Janicki and M. Koutny. Optimal simulations, nets and reachability graphs. In Advances in Petri Nets 1991, LNCS, volume 524, pages 205-226. Springer-Verlag, 1991.
98. R. Janicki and M. Koutny. Using optimal simulations to reduce reachability graphs. In Proceedings of the 2nd International Conference on Computer-Aided Verification CAV'90, LNCS, volume 531, pages 166-175. Springer-Verlag, London, 1991.
99. R. Janicki, P. E. Lauer, M. Koutny, and R. Devillers. Concurrent and maximally concurrent evolution of non-sequential systems. Theoretical Computer Science, 43:213-238, 1986.
100. K. Jensen. Coloured Petri Nets. Basic Concept, Analysis Methods and Practical Use. Volume 1: Basic Concepts. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1992.
101. K. Jensen and G. Rozenberg, editors. High-Level Petri Nets: Theory and Application. Springer-Verlag, Berlin, 1991.
102. A. A. Jerraya and J. Mermet, editors. System-Level Synthesis. Kluwer Academic Publishers, 1999.
103. J. Kalinowski. Wykorzystanie sieci Petriego do projektowania systemów cyfrowych. PhD thesis, Politechnika, Warszawska, 1984.
104. A. Karatkevich. Correctness analysis of a-nets. In Logical Control, volume 1, pages 97-106. Institute of Engineering Cybernetics, Academy of Sciences of Belarus, 1996. (in Russian).
105. A. Karatkevich. Analysis and Optimization of Parallel Logical Control Algorithms. PhD thesis, Belarusian State University of Informatics and Radioelectronics, Dept. of Computer Science, Minsk, 1997. Manuscript (in Russian).
106. A. Karatkevich. Reachability analysis of the live and safe Petri nets. In Proceedings of the 5th International Conference, the International Conference on Parallel Computing in Electrical Engineering PARELEC'98, pages 175-178, Bialystok, Poland, 1998.
107. A. Karatkevich. Hierarchical decomposition of safe Petri nets. In Proceedings of the 3rd International Conference on Computer - Aided Design of Discrete Devices, volume 1, pages 34-39, Minsk, Belarus, 1999.
108. A. Karatkevich. Minimization of transitions number for a parallel automaton. In Proceedings of the International Conference on Discrete Optimization Methods in Scheduling and Computer-Aided Design, pages 197-201, Minsk, Belarus, September 2000.
109. A. Karatkevich. Optimal simulation of α-nets. In Proceedings of the Polish-German Symposium on Science, Research and Education, pages 217-222, Zielona Góra, Poland, 2000.
110. A. Karatkevich. Dependence between some behaviour properties of α-nets. In Proceedings of the 4th International Conference on Computer-Aided Design of Discrete Devices, pages 57-60, Minsk, 2001.
111. A. Karatkevich. On algorithms for decyclisation of oriented graphs. In Proceedings of the International Workshop on Discrete - Event System Design, pages 35-40, Przytok k/Zielonej Góry, Poland, 2001.
112. A. Karatkevich. Dynamic reduction of reachability graphs of Petri nets. Radioelektronika i Informatika, (no l):76-82, 2002. (in Russian).
113. A. Karatkevich. Deadlock analysis in Statecharts. In Proceedings of the Forum on Specification and Design Languages, pages 414-424, Frankfurt, Germany, September 2003.
114. A. Karatkevich. To behavior analysis of a class of Petri nets. In Proc. of 27th IFAC/IFIP/IEEE Workshop on Real-Time Programming, pages 33-38, Lagow, Poland, May 2003. Elsevier, Oxford, UK.
115. A. Karatkevich. Detecting possible deadlock states in automata networks. Radiotechnika, nr 138:134-140, 2004. (in Russian).
116. A. Karatkevich. Detection of the unreachable states in FSM networks. In Proceedings of the 5th International Conference on Computer-Aided Design of Discrete Devices, pages 47-54, Minsk, 2004.
117. A. Karatkevich. Deadlock detection in discrete concurrent systems. In Proceedings of the 8th International Conference on experience of designing and application of CAD systems in microelectronics CADSM'2005, pages 250-253, Lviv-Polyana, Ukraine, 2005.
118. A. Karatkevich. Memory-saving analysis of Petri nets. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 65-74. Springer-Verlag, 2005.
119. A. Karatkevich. Properties and analysis of α-nets. Informatyka Teoretyczna i Stosowana, 5(8):53-64, 2005.
120. A. Karatkevich. Verification of implementation of parallel automata (testing approach). In Proceedings of the IEEE East-West Design and Test Workshop EWDTW'05, pages 66-69, Odessa, Ukraine, 2005.
121. A. Karatkevich. Stubborn set method for interpreted Petri nets. In Proceedings of the 3rd IFAC Workshop on Discrete-Event System Design, DESDes'06, pages 227-232, Rydzyna, Poland, 2006.
122. A. Karatkevich. Verification of implementation of parallel automata (symbolic approach). In Proceedings of the IEEE East-West Design and Test Workshop EWDTW'06, pages 112-115, Sochi, Russia, 2006.
123. A. Karatkevich and M. Adamski. Deadlock analysis of Petri nets: minimization of memory amount. In Proceedings of the 3th Electronic. Circuits and Systems Conference, pages 69-72, Bratislava, 2001.
124. A. Karatkevich, M. Adamski, and M. Wȩgrzyn. Rapid correctness analysis for Sequential Function Chart. In Proceedings of the 45th International Scienific Colloquium IWK'2000, pages 679-684, Ilmenau, Germany, October 2000.
125. A. Karatkevich and G. Andrzejewski. Analiza wybranych wlasności interpretowanej sieci Petriego metodź optymalnej symulacji. In Materiały Pierwszej Krajowej Konferencji Elekt,roniki, volume 2, pages 685-690, Kołobrzeg-Dźwirzyno, Polska, 2002.
126. A. Karatkevich and G. Andrzejewski. Hierarchical decomposition of Petri nets for analysis and design of digital microsystems. International Journal of Computing, 5(1):18-25, 2006.
127. A. Karatkevich and G. Andrzejewski. Hierarchical decomposition of Petri nets for digital microsystems design. In Proceedings of the International Conference, on Modern Problems of Radio Engineering, Telecommunications and Computer Science - TCSET'2006, pages 518-521, Lviv-Slavsk, Ukraine, 2006.
128. A. Karatkevich and T. Gratkowski. Analysis of the operational Petri nets by a distributed system. In Proceedings of the International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science - TCSET'2004, pages 319-322, Lviv-Slavsk, Ukraine, 2004.
129. A. Karatkevich and M. Wȩgrzyn. ATPG: Current State and Main Problems. In Proceedings of the Polish-German Symposium on Science, Research and Education, pages 205-210, Zielona Góra, Poland, 2000.
130. A. Karatkevich and A. Zakrevskij. Analysis of Petri nets by means of concurent simulation. In Proceedings of the International Conference on Parallel Computing in Electrical Engineering PARELEC, pages 87-91, Warsaw, Poland, 2002. IEEE Computer Society.
131. A. Karatkiewicz. Dynamiczna analiza systemów współ bieznych. In Materiały konferencji naukowej Inforrnatyka - sztuka czy rzemioslo, K NWS '04, pages 41-46, Zielona Góra, Polska, 2004.
132. A. Karatkiewicz. Wykrywanie blokad w systemach priorytetowych. In Materiały konferencji naukowej Inforrnatyka - sztuka czy rzemioslo, KNWS '05, pages 67-72, Zielona Góra, 2005.
133. P. Kemper. Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net. In Proceedings of the 14th International Conference, on Application and Theory of Petri Nets 1993, Chicago, USA, Lecture Notes in Computer Science, volume 691, pages 319-338. Springer-Verlag, 1993.
134. P. Kemper. Superposition of Generalized Stochastic Petri Nets and its Impact on Performance Analysis. PhD thesis, University of Dortmund, Dep. of CS, 1997.
135. P. Kemper and F. Bause. An efficient polynomial-time algorithm to decide liveness and boundedness of free choice nets. In Proceedings of the 13th International Conference on Application and Theory of Petri Nets, Sheffield, Lecture Notes in Computer Science, volume 616, pages 263-278, 1992.
136. G. Klas. Hierarchical solution of generalized stochastic petri nets by means of traffic processes. In Proceedingsof the 13th International Conference on Application and Theory of Petri, Nets, Sheffield, Lecture Notes in Computer Science, volume 616, pages 279-298, 1992.
137. R. König and L. Quäck. Petri-Netze in der Steuerungstechnik. Oldenbourg, München, 1988.
138. A. Korotkevich. Analysis of asynchronous systems of simple sequentions. In Proceedings of the 39th International Scientific Colloquium, IWK'94, pages 446-452, Ilmenau, Germany, 1994.
139. A. Korotkevich. Checking properties of the asynchronous systems of sequents by using reduction. In Proceedings of the International Conference on Computer-Aided Design of Discrete Devices (CAD DD'95), pages 99-102, Minsk-Szczecin, 1995. Wydawnictwo Uczelniane Politechniki Szczecinskiej.
140. V. Ye. Kotov. Petri Nets. Moscow, Nauka, 1984. (in Russian).
141. A. V. Kovalyov. Concurrency relation and the safety problem for Petri nets. In Proceedings of the 13th International Conference on Application and Theory of Petri Nets 1992, Lecture Notes in Computer Science, volume 616, pages 299-309. Springer-Verlag, June 1992.
142. A. V. Kovalyov. An O(|S| × |T|)-algorithm to verify if a net is regular. In Proceedings of the 17th International Conference in Application and Theory of Petri Nets 1996, Lecture Notes in Computer Science, volume 1091, pages 366-379. Springer-Verlag, June 1996.
143. T. Kozlowski. Petri Net Specification Format (PNSF). Technical report, University of Bristol, 1994.
144. T. Kozlowski, E. Dagless, J. Saul, M. Adamski, and J. Szajna. Parallel controller synthesis using Petri nets. IEE Proceedings - Computers and Digital Techniques, 142(4):263-271, 1995.
145. L. M. Kristensen. State Space Methods for Coloured Petri Nets. PhD thesis, University of Aarhus, 2000.
146. S. Kumagai, S. Kodama, K. Tsuji, and Y. Nakamura. Preservation of liveness in hierarchical Petri nets. Electron. Commun. Jpn., Part III, Fundam. Electron. Sci., 73(5):8-18, May 1990.
147. O. P. Kuznetsov and G. M. Adelson-Velski. Discrete Mathematics for Engineer. Energoatomizdat, Moscow, 1988. (in Russian).
148. G. Łabiak. Modelling Statecharts diagrams by means of Petri nets. In Proceedings of the 6th International Conference on Advanced Computer Systems, pages 253-259, Szczecin, October 1999.
149. G. Łabiak. From UML Statecharts to FPGA - the HiCoS approach. In Proceedings of the Forum on Specification and Design Languages, pages 354-363, Frankfurt, Germany, 2003.
150. G. Labiak. Symbolic state exploration of UML Statecharts for hardware description. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 73-83. Springer-Verlag, New York, 2005.
151. G. Labiak. Wykorzystanie hierarchicznego modelu wspotbieznego automatu w projektowaniu sterowników cyfrowych. PhD thesis, Uniwersytet Zielonogorski, 2005.
152. G. Labiak and M. Adamski. The method of concurrency matrix generation for statechart-based digital controllers. In Proceedings of the 11th International Conference on Mixed Design of Integrated Circuits and Systems, pages 445-450, Szczecin, Poland, 2004.
153. G. Łabiak and A. Karatkevich. Metody specyfikacji, syntezy i weryfikacji hierarchicznych diagramów stanów. IX Konferencja Naukowa Reprogramowalne Ukşady Cyfrowe, Pomiary Automatyka Kontrola, (Nr. 7, wyd. spec.):109-111, 2006.
154. G. Łabiak and P. Miczulski. UML statecharts and Petri nets model comparison for system level modelling. Mezhdunarodny sbornik nauchnykh trudov: Progressivnye technologii i sistemy mashinostroyeniya, 27:310-314, 2004. Donetsk National Technical University, Ukraine.
155. K. Lautenbach. Linear algebraic calculation of deadlocks and traps. In Concurrency and Nets, Advances of Petri Nets. Springer-Verlag, Berlin, 1987.
156. K. Lautenbach and H. A. Ridder. A Completion of the S-invariance Technique by means of Fixed Point Algorithms. Research Report 10-95, Universität Koblenz, 1995.
157. B. Lee and E. A. Lee. Hierarchical Concurrent Finite State Machines in Ptolemy. In Proceedings of the International Conference on Application of Concurrency to System Design, pages 34-40, Fukushima, Japan, March 1998.
158. A. Lempel. Minimum feedback arc and vertex sets of a directed graph. IEEE Trans. Circuit Theory, CT-13(4):399-403, December 1966.
159. R. W. Lewis. Programming Industrial Control Systems Using IEC 1131-3. IEE, London, 1995.
160. M. Makela. A Reachability Analyzer for Algebraic System Nets. Research Report A69, Helsinki University of Technology, 2001.
161. H. J. Mathony. Algorithmische Entwurfstverfahren für Zwei- und Mehrstufige Schaltnetze. PhD thesis, ITIV, Universität Karlsruhe, 1988.
162. H. J. Mathony. Universal logic design algorithm and its application the synthesis of two-level switching circuits. Proceedings of the IEE, 136(3):171-177, 1989.
163. A. Mazurkiewicz. Trace theory. In Petri, Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, September 1986, Lecture Notes in Computer Science, volume 255, pages 279-324, New York, USA, 1987. Springer-Verlag.
164. C. McCreary, J. Thompson, H. Gill, T. Smith, and Y. Zhu. Partitioning and Scheduling Using Graph Decomposition. Department of Computer Science and Engineering CSE-93-06, Auburn University, 1993.
165. K. L. McMillan. Using unfolding to avoid the state explosion problem in the verification of asynchronous circuits. In Proceedings of the 4th International Conference on Computer Aided Verification, Lecture Notes in Computer Science, volume 663, pages 164-177, Montreal, Canada, June 1992. Springer Verlag.
166. D. De Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York, 1994.
167. P. Miczulski. Calculating state spaces of hierarchical Petri nets using BDD. In Design of Embedded Control Systems, pages 85-94. Springer, New York, 2005.
168. P. Miczulski. Weryfikacja, i synteza programów dla reprogramowalnych sterowników logicznych z wykorzystaniem funkcji monotonicznych i diagramow BDD. IX Konferencja Naukowa Reprogramowalne Ukşady Cyfrowe, Pomiary Automatyka Kontrola, (Nr. 7, wyd. spec.):112-114, 2006.
169. R. Milner. Communication and Concurrency. Prentice-Hall, Inc., 1989.
170. M. Minoux and K. Barkaoui. Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems. Discrete Mathematics, 29:195-210, 1990.
171. M. Montalbano. High-speed calculation of the critical paths of large networks. IBM Systems Journal, 6(3):163-191, 1967.
172. T. Murata. Petri nets: properties, analysis and applications. Proceedings of the IEEE, 77:541-580, April 1989.
173. D. Nazareth, F. Regensburger, and P. Sholz. Mini-Statecharts, A Lean Version of Statecharts. Technical Report TUMÜI9610, Technische Universität München, 1996.
174. R. Nelson. Simplest normal truth functions. Journal of Symbolic Logic, 20(2): 105-108, 1955.
175. M. Notomi and T. Murata. Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis. IEEE Trans. Softw. Eng., 20(5):325-336, 1994.
176. A. Ohta, K. Tsuji, and T. Hisamura. On liveness of extended partially ordered condition nets. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E82-A(11):2576-2578, 1999.
177. G. K. Palshikar. An introduction to model checking, 2004. www.embedded.com.
178. Ch. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
179. J. Pardey, A. Amroun, M. Bolton, and M. Adamski. Parallel controller synthesis for programmable logic devices. Microprocessors and Microsystems, 18(8):451-457, 1994.
180. E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets. In Proceedings of the Conference on Design, Automation and Test in Europe, Paris, France, pages 790-795, 1998.
181. E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri net analysis
182. D. Peled. All from one, one for all: on model checking using representatives. In Proceedings of the 5th International Conference on Computer Aided Verification, Lecture Notes In Computer Science, volume 697, pages 409-423. Springer-Verlag, 1993.
183. J. L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, 1981.
184. C. A. Petri. Kommunikation mit Automaten. Schriften des UM Nr. 2, Institut für Instrumentelle Matematik, Bonn, 1962.
185. Yu. V. Pottosin. Generation of parallel automata. In Methods and Algorithms for Logical Design, pages 132-142, Minsk, 1995. Institute of Engineering Cybernetics of Academy of Sciences of Belarus, (in Russian).
186. Yu. V. Pottosin. Optimal state assignment of synchronous parallel automata. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 111-124, New York, 2005. Springer-Verlag.
187. M. Rauhamaa. A Comparative Study of Methods for Efficient Reachability Analysis. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 1990.
188. W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
189. R. Rudell and A. Sangiovanni-Vincentelli. Multiple-valued minimization for PLA optimization. IEEE Transactions on CAD/ICAS, CAD-6(5):727-750, Sept. 1987.
190. B. Rytsax and V. Minziuk. The set-theoretical modification of boolean functions minimax covering method. In Proceedings of the International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science, TCSET'04, pages 46-48, Lviv-Slavsko, Ukraine, 2004.
191. V. M. Savi and X. Xie. Liveness and boundedness analysis for petri nets with event graph modules. In 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, Lecture Notes in Computer Science, volume 616, pages 328-347. Springer-Verlag, June 1992.
192. K. Schmidt. How to calculate symbolically siphons and traps of algebraic Petri nets. In Technical Report A39, pages 1-40. Helsinki University of Technology, 1996.
193. K. Schmidt. Siphons and traps for algebraic Petri nets. In Proceedings of the Workshop CSP, pages 157-168, Berlin, Oct 1996.
194. K. Schmidt. Characterizing liveness of Petri nets in terms of siphons. In Proceedings of the 18th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, volume 1248, pages 271-289. Springer-Verlag, June 1997.
195. T. Schober, A. Reinsch, and W. Erhard. Modeling and verification of sequential control paths using Petri nets. In Proceedings of the International Workshop on Discrete - Event System Design, pages 41-46, Przytok k/Zielonej Góry, Poland, 2001.
196. T. Schober, A. Reinsch, and W. Erhard. Verification of control paths using Petri nets. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 51-62, New York, 2005. Springer-Verlag.
197. J. Sifakis. Le Controle des Systèmes Asynchrones: Concepts, Proprietes, Analyse Statique. PhD thesis, l'Universite Scientifique et Medicale de Grenoble, 1979.
198. M. Silva. Las redes de Petri: en la Automática y la Informática. Ed. AC, 1985.
199. Z. Skowronski. Translacja specyfikacji funkcjonalnej układów cyfrowych na sieć Petirego dla potrzeb syntezy systemowej. PhD thesis, Politechnika Szczecińska, Wydział Informatyki, 2000.
200. J. Staunstrup, H. R. Andersen, H. Hulgaard, J. Lind-Nielsen, K. G. Larsen, G. Behrmann, K. Kristoffersen, A. Skou, H. Leerberg, and N. B. Theilgaard. Practical verification of embedded software. IEEE Computer, 33(5):68-75, 2000.
201. B. Steinbach and A. D. Zakrevskij. Parallel automaton - basic model, properties and high-level diagnostics. In Proceedings of the 4th International Workshop on Boolean Problems, pages 151-158, Freiberg, Germany, 2000.
202. B. Steinbach and A. D. Zakrevskij. Parallel automaton and its hardware implementation. In Proceedings of the Design and Diagnostics of Electronic Circuits and Systems Workshop, pages 250-257, Smolenice, 2000.
203. U. Stern and L. D. Dill. Parallelizing the Murphy verifier. In Proceedings of the International Conference CAV'97, LNCS, pages 256-267. Springer, 1997.
204. M. E. Szabo, editor. The Collected Papers of Gerhard Gentzen. North-Holland, Amsterdam, 1969.
205. B. Taconet and B. Chollot. Grafcet programming on programmable logic controller with logical, ladder and boolean language. Revue Nouvel Automatisme, 24(1-2):41-45, 1979.
206. S. Tanimoto, M. Yamauchi, and T. Watanabe. Finding minimal siphons in general Petri nets. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E79-A(11):1817-1824, 1996.
207. B. Thelen. Investigation of Algorithms for Computer-Aided Logic Design of Digital Circuits. PhD thesis, Universität Karlsruhe, 1988. (in German).
208. V. V. Tropashko. Proof of the conjecture of complete reducibility of α-nets. In Design of Logical Control Systems, pages 13-21. Institute of Engineering Cybernetics of Academy of Sciences of BSSR, 1986. (in Russian).
209. OMG Unified Modeling Languag Specification Version 1.5. OMG, 250 First Avenue, Needham, MA 02494, U.S.A., March 2003.
210. A. Valmari. Eliminating redundant interleavings during concurrent program verification. In Proceedings of the Conference on Parallel Architectures and Languages Europe, Vol. 2, Lecture Notes in Computer Science, volume 366, pages 89-103, Berlin, Germany, 1989. Springer-Verlag.
211. A. Valmari. A stubborn attack on state explosion. In Proceedings of the 2nd International Workshop on Computer Aided Verification, CAV '90, LNCS, volume 531, pages 156-165, London, UK, 1991. Springer-Verlag.
212. A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets 1990, Lecture Notes in Computer Science, volume 483, pages 491-515. Springer-Verlag, Berlin, Germany, 1991.
213. A. Valmari. On-the-fly verification with stubborn sets. In Proceedings of the 5th International Conference on Computer Aided Verification, CAV'93, LNCS, volume 697, pages 397-408, London, UK, 1993. Springer-Verlag.
214. A. Valmari. Compositional analysis with place-bordered subnets. In Application and Theory of Petri Nets, LNCS 815, pages 531-547. Springer, 1994.
215. A. Valmari. State of the art report: Stubborn sets. Petri Net Newsletter, (46):6-14, April 1994.
216. A. Valmari. Stubborn set methods for process algebras. In Proceedings of the DIMACS workshop on Partial order methods in verification, POMIV'96, pages 213-231, New York, USA, 1997.
217. A. Valmari. The state explosion problem. In Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models, volume 1491, pages 429-528. Springer-Verlag, 1998.
218. V. Varadharajan and K. D. Baker. Directed graph based representation for software system design. Software Engineering J., 2(1):21-28, January 1987.
219. K. Varpaaniemi. On combining the stubborn set method with the sleep set method. In Proceedings of the 15th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, volume 815, pages 548-567. Springer-Verlag, Berlin, Germany, 1994.
220. K. Varpaaniemi. On Computing Symmetries and Stubborn Sets. Technical Report B12, Helsinki University of Technology, Digital Systems Laboratory, 1994.
221. K. Varpaaniemi. On the Stubborn Set Method in Reduced State Space Generation. PhD thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 1998.
222. K. Varpaaniemi. Stubborn sets for prioriry nets. In Proceedings of ISCIS 2004, Lecture Notes in Computer Science, volume 3280, pages 574-583. Springer-Verlag, Berlin, Germany, 2004.
223. M. von der Beeck. A Comparison of Statecharts Variants. In LNCS, volume 860, pages 128-148. Springer-Verlag, 1994.
224. F. Wagner and M. Rakowski. Zastosowanie sieci Petriego do projektowania mikroprogramowych układów sekwencyjnych. Archiwum Automatyki i Telemechaniki, 26(3):385-395, 1981.
225. P. Wołański. Modelowanie układów cyfrowych na poziomie RTL z wykorzystaniem sieci Petriego i podzbioru jȩzyka VHDL. PhD thesis, Politechnika Warszawska, 1998.
226. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proceedings of the 4th International Conference on Concurrency Theory, CONCUR'93, LNCS, volume 715, pages 233-246. Springer-Verlag, UK, 1993.
227. A. Wȩgrzyn and P. Bubacz. XML format for high-level Petri net. In Proceedings of ACS 2001, volume 2, pages 269-278, Szczecin, 2001.
228. A. Wȩgrzyn, A. Karatkevich, and J. Bieganowski. Detection of deadlocks and traps in Petri nets by means of Thelen's prime implicant method. Applied Mathematics and Computer Science, 14(1):113-121, 2004.
229. A. Wȩgrzyn and M. Wȩgrzyn. Symbolic veification of concurrent logic controllers by means Petri nets. In Proceedings of CAD DD'99, volume 1, pages 45-50, Minsk, Belarus, 1999.
230. M. Yamauchi, S. Tanimoto, and T. Watanabe. Finding a minimal siphon containing specified places in a general Petri net. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E79-A(11):1825-1828, 1996.
231. M. Yamauchi and T. Watanabe. Time complexity analysis of the minimal siphon extraction problem of Petri nets. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E82-A(11):2558-2565, 1999.
232. S. A. Yuditski, A. A. Tagayevskaya, and G. K. Yefremova. A Language for Algorithmic Design of Discrete Control Devices. Preprint of Institute of Control Sciences, Moscow, 1977. (in Russian).
233. S. A. Yuditski, A. A. Tagayevskaya, and G. K. Yefremova. Design of Discrete. Systems of Automatics. Mashinostroyeniye, Moscow, 1980. (in Russian).
234. V. N. Zakharov. Sequent description of control automata. Izvestiya AN SSSR, (2), 1972. (in Russian).
235. A. D. Zakrevskii. Verifying the correctness of parallel logical control algorithms. Program. Comput. Softw. (USA), 13(5):218-221, 1987.
236. A. D. Zakrevskij. A-net - a functional model of a discrete system. Doklady AN BSSR, 25(8):714-717, 1981. (in Russian).
237. A. D. Zakrevskij. Logical Synthesis of Cascade Networks. Nauka, Moscow, 1981. (in Russian).
238. A. D. Zakrevskij. Reduction method of correctness checking of parallel logical control algorithms. Doklady AN BSSR, 27(7):617-619, 1982. (in Russian).
239. A. D. Zakrevskij. Implementation of parallel logical control algorithms on programmable logic arrays. Automatika i Telemechanika, (7):116-123, 1983. (in Russian).
240. A. D. Zakrevskij. Parallel automaton. Doklady AN BSSR, 28(8):717-719, 1984. (in Russian).
241. A. D. Zakrevskij. To checking liveness of ordinary Petri nets. Doklady AN BSSR, 29(11):1006-1009, 1985. (in Russian).
242. A. D. Zakrevskij. Elements of the theory of α-nets. In Design of Logical Control Systems, pages 4-12. Institute of Engineering Cybernetics of Academy of Sciences of BSSR, 1986. (in Russian).
243. A. D. Zakrevskij. The analysis of concurrent logic control algorithms. In Fundamentals in Computation Theory, Lecture Notes in Computer Science, volume 278, pages 497-500. Springer-Verlag, 1987.
244. A. D. Zakrevskij. Decomposition approach to analysis of parallel logical control algorithms. In Formal Models of Parallel Computation. Siberian section of Academy of Sciences of the USSR, Novosibirsk, 1988. (in Russian).
245. A. D. Zakrevskij. To the theory of parallel algorithms of logical control. Izvestiya AN SSSR, Tekhnicheskaya Kibernetika, (5):179-191, 1989. (in Russian).
246. A. D. Zakrevskij. Optimization of matrix of partial state assignment for parallel automata. In Formalization and Automatization of Logical Design, pages 4-11. Institute of Engineering Cybernetics of Academy of Science of Belarus, 1993. (in Russian).
247. A. D. Zakrevskij. Parallel logical control algorithms: verification and hardware implementation. Computer Science Journal of Moldova, 4(1):3-19, 1996.
248. A. D. Zakrevskij. High-level design of logical control devices. In Proceedings of the 3rd International Conference on Computer-Aided Design of Discrete Devices, pages 13-18, Minsk, 1999.
249. A. D. Zakrevskij. Parallel Algorithms of Logical Control. Second edition, URSS, Moscow, 2003. (in Russian).
250. A. D. Zakrevskij. Using sequents for description of concurrent digital systems behavior. In M. Adamski, A. Karatkevich, and M. Wȩgrzyn, editors, Design of Embedded Control Systems, pages 3-13, New York, 2005. Springer-Verlag.
251. A. D. Zakrevskij, A. G. Karatkevich, and M. A. Adamski. A method of analysis of operational Petri nets. In Proceedings of the 8th International Conference on Advanced computer systems, pages 449-460. Kluwer Academic Publishers, Boston, 2002.
252. A. D. Zakrevskiy. Petri nets modeling of logical control algorithm. Autom. Control & Comput. Sci., 20(6):38-45, 1986.
253. M. Zhou and F. DiCesare. Petri Net Synthesis for Discrete Event Control of Manufacturing Systems. Kluwer Academic Publishers, Boston, 1993.