|
|
|
Список литературы
|
|
|
1. |
Башкин В. А., “Сети активных ресурсов”, Моделирование и анализ информационных систем, 14:4 (2007), 13–19 [Bashkin V.A., “Nets of active resources”, Model. Anal. Inform. Sist., 14:4 (2007), 13–19 (in Russian)] |
2. |
Башкин В. А., “Формализация семантики систем с ненадежными агентами при помощи сетей активных ресурсов”, Программирование, 36:4 (2010), 3–15 ; English transl.: Bashkin V. A., “Formalization of semantics of systems with unreliable agents by means of nets of active resources”, Progr. and Comp. Soft., 36:4 (2010), 187–196 |
3. |
Зайцев Д. А., “Верификация вычислительных решеток с особыми краевыми условиями бесконечными сетями Петри”, Моделирование и анализ информационных систем, 19:6 (2012), 21–33 ; English transl.: Zaitsev D. A., “Verification of computing grids with special edge conditions by infinite Petri nets”, Automatic Control and Computer Sciences, 47:7 (2013), 403–412 |
4. |
Котов В. Е., Сети Петри, Наука, М., 1984 [Kotov V. E., Seti Petri, Nauka, M., 2008 (in Russian)] |
5. |
Кузьмин Е. В., Чалый Д. Ю., “О разрешимости проблем ограниченности для счетчиковых машин Минского”, Моделирование и анализ информационных систем, 15:1 (2008), 16–26 [Kuzmin E. V., Chalyy D. Ju., “On the decidability of boundedness problems for counter Minsky machines”, Model. Anal. Inform. Sist., 15:1 (2008), 16–26 (in Russian)] |
6. |
Alur R., Dill D., “Automata for modeling real-time systems”, Automata, Languages and Programming, Lecture Notes in Computer Science, 443, 1990, 322–335 |
7. |
Bashkin V. A., “Nets of active resources for distributed systems modeling”, Joint Bulletin of NCC$\&$IIS, Comp. Science, 28, Novosibirsk, 2008, 43–54 |
8. |
Bashkin V. A., Lomazova I. A., “Resource Driven Automata Nets”, Fundamenta Informaticae, 109:3 (2011), 223–236 |
9. |
Bashkin V. A., Lomazova I. A., “Cellular Resource Driven Automata Nets”, Fundamenta Informaticae, 120:3-4 (2012), 245–259 |
10. |
Bashkin V. A., Lomazova I. A., Novikova Yu. A., “Timed Resource Driven Automata Nets for Distributed Real-Time Systems Modelling”, Parallel Computing Technologies, Lecture Notes in Computer Science, 7979, 2013, 13–25 |
11. |
Bednarczyk M. A., Bernardinello L., Pawlowski W., Pomello L., “Modelling mobility with Petri Hypernets”, Recent Trends in Algebraic Development Techniques, Lecture Notes in Computer Science, 3423, Springer, 2005, 28–44 |
12. |
Cook M., “Universality in Elementary Cellular Automata”, Complex Systems, 15:1 (2004), 1–40 |
13. |
Finkel A., Schnoebelen Ph., Well-Structured Transition Systems Everywhere!, Theoretical Computer Science, 256:1–2 (2001), 63–92 |
14. |
Jensen K., Colored Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Springer, 1994 |
15. |
Köhler-Bußmeier M., “Hornets: Nets within Nets combined with Net Algebra”, ICATPN'2009, Lecture Notes in Computer Science, 5606, Springer, 2009, 243–262 |
16. |
Lomazova I. A., “Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems”, Fundamenta Informaticae, 43:1–4 (2000), 195–214 |
17. |
Nehaniv C. L., “Asynchronous Automata Networks Can Emulate Any Synchronous Automata Network”, Int. J. of Algebra and Computation, 14:5–6 (2004), 719–739 |
18. |
Petri C. A., Kommunikation mit Automaten, PhD thesis, Bonn Institute für Instrumentelle Mathematik, 1962 |
19. |
Valk R., “Petri Nets as Token Objects: An Introduction to Elementary Object Nets”, ICATPN'98, Lecture Notes in Computer Science, 1420, Springer, 1998, 1–25 |