ΠΠΈΡΠ΅ΡΠ°ΡΡΡΠ°. ΠΠ± ΠΎΠ΄Π½ΠΎΠΌ ΠΏΠΎΠ΄Ρ ΠΎΠ΄Π΅ ΠΊ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΠΌΠΈ ΡΠΈΡΡΠ΅ΠΌΠ°ΠΌΠΈ
ΠΠ°Π½Π΄ΠΌΠ°Π½ ΠΈ Π΄Ρ., 1990] ΠΠ°Π½Π΄ΠΌΠ°Π½ Π. Π. ΠΈ Π΄Ρ. Π’Π΅ΡΡΠΈΡΠΎΡΠΈΠ°Π»ΡΠ½ΠΎ-ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠ²Π΅Π½Π½ΡΠ΅ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΡ: ΠΡΠΎΠ³Π½ΠΎΠ·ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΠ° ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΡΠ΅ΡΠ΅ΠΉ ΠΠ΅ΡΡΠΈ — ΠΠΎΠ²ΠΎΡΠΈΠ±ΠΈΡΡΠΊ: ΠΠ°ΡΠΊΠ°. Π‘ΠΈΠ±. ΠΎΡΠ΄-Π½ΠΈΠ΅, 1990. Lomazova et al, 99] Lomazova I.& Schnoebelen Ph. Some decidability results for nested Petri nets — Perspectives of System Informatics (Proceedings of Andrei Ershov Third International Conference… Π§ΠΈΡΠ°ΡΡ Π΅ΡΡ >
ΠΠΈΡΠ΅ΡΠ°ΡΡΡΠ°. ΠΠ± ΠΎΠ΄Π½ΠΎΠΌ ΠΏΠΎΠ΄Ρ ΠΎΠ΄Π΅ ΠΊ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΠΌΠΈ ΡΠΈΡΡΠ΅ΠΌΠ°ΠΌΠΈ (ΡΠ΅ΡΠ΅ΡΠ°Ρ, ΠΊΡΡΡΠΎΠ²Π°Ρ, Π΄ΠΈΠΏΠ»ΠΎΠΌ, ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½Π°Ρ)
1. [ΠΠ°Π½Π΄ΠΌΠ°Π½ ΠΈ Π΄Ρ., 1990] ΠΠ°Π½Π΄ΠΌΠ°Π½ Π. Π. ΠΈ Π΄Ρ. Π’Π΅ΡΡΠΈΡΠΎΡΠΈΠ°Π»ΡΠ½ΠΎ-ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠ²Π΅Π½Π½ΡΠ΅ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΡ: ΠΡΠΎΠ³Π½ΠΎΠ·ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΠ° ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΡΠ΅ΡΠ΅ΠΉ ΠΠ΅ΡΡΠΈ — ΠΠΎΠ²ΠΎΡΠΈΠ±ΠΈΡΡΠΊ: ΠΠ°ΡΠΊΠ°. Π‘ΠΈΠ±. ΠΎΡΠ΄-Π½ΠΈΠ΅, 1990.
2. [ΠΠΎΡΠΎΠ², 1984] ΠΠΎΡΠΎΠ² Π. Π. Π‘Π΅ΡΠΈ ΠΠ΅ΡΡΠΈ. — Π.: ΠΠ°ΡΠΊΠ°, 1984.
3. [ΠΠΎΠΌΠ°Π·ΠΎΠ²Π°, 98] ΠΠΎΠΌΠ°Π·ΠΎΠ²Π° Π. Π., ΠΡΡΠ΅Π½ΠΊΠΎ Π. Π. ΠΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·Π΄Π΅Π»Π΅Π½Π½ΠΎΠ³ΠΎ Π΄ΠΎΡΡΡΠΏΠ° ΡΡΠ΅Π΄ΡΡΠ²Π°ΠΌΠΈ ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ ΡΠ΅ΡΠ΅ΠΉ ΠΠ΅ΡΡΠΈ — ΠΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΈ Π°Π½Π°Π»ΠΈΠ· ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ ΡΠΈΡΡΠ΅ΠΌ. ΠΡΠΏ. 5, Ρ.62−73. — Π―ΡΠΎΡΠ»Π°Π²Π»Ρ, Π―ΡΠΎΡΠ»Π°Π²ΡΠΊΠΈΠΉ Π³ΠΎΡΡΠ½ΠΈΠ²Π΅ΡΡΠΈΡΠ΅Ρ, 1998.
4. [ΠΠΎΠΌΠ°Π·ΠΎΠ²Π°, 99] ΠΠΎΠΌΠ°Π·ΠΎΠ²Π° Π. Π. ΠΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΡ Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈΡ ΡΠΈΡΡΠ΅ΠΌ Π²Π»ΠΎΠΆΠ΅Π½Π½ΡΠΌΠΈ ΡΠ΅ΡΡΠΌΠΈ ΠΠ΅ΡΡΠΈ — ΠΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ: Π’Π΅ΠΎΡΠ΅ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΎΡΠ½ΠΎΠ²Ρ ΠΈ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡ, Ρ.143−156. — Π.: ΠΠ°ΡΠΊΠ°. Π€ΠΈΠ·ΠΌΠ°ΡΠ»ΠΈΡ, 1999.
5. [ΠΠΎΡΠΏΠ΅Π»ΠΎΠ², 81] ΠΠΎΡΠΏΠ΅Π»ΠΎΠ² Π. Π. ΠΠΎΠ³ΠΈΠΊΠΎ-Π»ΠΈΠ½Π³Π²ΠΈΡΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ Π² ΡΠΈΡΡΠ΅ΠΌΠ°Ρ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ. — Π.: ΠΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠ°, 1981.
6. [ΠΠΎΡΠΏΠ΅Π»ΠΎΠ², 86] ΠΠΎΡΠΏΠ΅Π»ΠΎΠ² Π. Π. Π‘ΠΈΡΡΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ΅ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠ΅: Π’Π΅ΠΎΡΠΈΡ ΠΈ ΠΏΡΠ°ΠΊΡΠΈΠΊΠ°. — Π.: ΠΠ°ΡΠΊΠ°, 1986.
7. [Badouel, 98] Badouel E. R’eseaux de etri `a structures dynamiques, une bibliographie comment’ee — Mod’elisation et v’erification des processus parall’eles (MOVEP'98), Actes de l''ecole d''et'e, 'Ecole Centrale de Nantes, 6−9 Juillet 1998, pp.201−206.
8. [Battiston et al, 95] Battiston E., Chizzoni A., De Cindio F. Inheritance and Concurrency in CLOW — Proceeding of the 2nd Workshop on Object-Oriented Programming and Models of Concurrency — Turin, 1995.
9. [Finkel et al, 97] Finkel A., Schnoebelen Ph. Well-structured transition systems everywhere! — Accepted for publication in Theoretical Computer Science. October, 1997.
10. [Hack, 74] Hack M. Analysis of Production Schemata by Petri Nets. — Cambridge: MIT, 1974.
11. [Lakos, 95] Lakos C.A. From Coloured Petri Nets to Object Petri Nets — Proc. Int. Conf. on Applications and Theory of Petri Nets, LNCS 935, pp.278−297 — Springer-Verlag, 1995.
12. [Lomazova, 97a] Lomazova I.A. On Proving Large Distributed Systems: Petri Net Modules Verification — Proc. of The 4th Int. Conference on Parallel Computing Technologies, Lecture Notes in Computer Science, Vol.1277, pp.70−75 — Springer, 1997.
13. [Lomazova, 97b] Lomazova I.A. Multi-Agent Systems and Petri Nets — Proceedings of Int. Workshop «Distributed Artificial Intelligence and Multi-Agent Systems» DAIMAS'97, June 15−18, 1997, pp.147−152 -St.Petersburg, 1997.
14. [Lomazova et al, 99] Lomazova I.& Schnoebelen Ph. Some decidability results for nested Petri nets — Perspectives of System Informatics (Proceedings of Andrei Ershov Third International Conference), p.143−148 — Novosibirsk: A.P.Ershov Institute of Informatic Systems, 1999.
15. [Lomazova, 99] Lomazova I.A. Nested Petri nets — a Formalism for Specification of Multi-Agent Distributed Systems — Proceedings of the Concurrency Specification and Programming (CS&P'99) Workshop, Warsaw, Poland, 28−30 September 1999, p.127−140 — Warsaw, 1999.
16. [Moldt et al, 97] Moldt D., Wienberg F. Multi-Agent Systems Based on Coloured Petri nets — Proc. Int. Conf. on Application and Theory of Petri Nets, LNCS 1248, pp.82−101 — Springer-Verlag, 1997.
17. [Sibertin-Blanc, 94] Sibertin-Blanc C. Cooperative nets — Proc. of the 15th Int. Conf. on Application and Theory of Petri Nets, LNCS 815, pp.471−490 — Springer-Verlag, 1994.
18. [Thiagarajan et al, 86] Thiagarajan P. S., Voss K. In Praise of Free-Choice Petri nets — Lecture Notes in Computer Science, Vol.188, pp. 438−453 — Springer-Verlag, 1986.
19. [Valk, 95] Valk R. How to Define Markings in Object Systems. Petri Nets Newsletter 50 — Gessellschaft f" ur Informatik — Bonn, 1995, pp.3−8.
20. [Valk, 98] Valk R. Petri Nets as Token Objects: An Introduction to Elementary Object Nets. — Proc. Int. Conf. on Application and Theory of Petri Nets, LNCS 1420, pp.1−25- Springer-Verlag, 1998.