Showing 1 - 6 results of 6 for search '"пространственная ограниченность"', query time: 0.48s Refine Results
  1. 1
    Academic Journal

    Source: Modeling and Analysis of Information Systems; Том 24, № 4 (2017); 391-409 ; Моделирование и анализ информационных систем; Том 24, № 4 (2017); 391-409 ; 2313-5417 ; 1818-1015

    File Description: application/pdf

    Relation: https://www.mais-journal.ru/jour/article/view/530/406; Башкин В. А., “Сети активных ресурсов”, Моделирование и анализ информационных систем, 14:4 (2007), 13-19; Башкин В. А., “Формализация семантики систем с ненадежными агентами при помощи сетей активных ресурсов”, Программирование, 36:4 (2010), 3-15; Зайцев Д. А., “Верификация вычислительных решеток с особыми краевыми условиями бесконечными сетями Петри”, Моделирование и анализ информационных систем, 19:6 (2012), 21-33; Котов В. Е., Сети Петри, Наука, М., 1984; Кузьмин Е. В., Чалый Д.Ю., “О разрешимости проблем ограниченности для счетчиковых машин Минского”, Моделирование и анализ информационных систем, 15:1 (2008), 16-26; Alur R., Dill D., “Automata for modeling real-time systems” (Automata, Languages and Programming), Lecture Notes In Computer Science, 443 (1990), 322-335.; Bashkin V. A., “Nets of active resources for distributed systems modeling”, Joint Bulletin of NCC&IIS, Comp. Science, 28 (2008), 43-54.; Bashkin V. A., Lomazova I. A., “Resource Driven Automata Nets”, Fundamenta Informaticae, 109:3 (2011), 223-236.; Bashkin V. A., Lomazova I. A., “Cellular Resource Driven Automata Nets”, Fundamenta Informaticae, 120:3-4 (2012), 245-259.; 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.; 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 (2005), 28-44.; Cook M., “Universality in Elementary Cellular Automata.”, Complex Systems, 15:1 (2004), 1-40.; Finkel A., Schnoebelen Ph., “Well-Structured Transition Systems Everywhere!”, Theoretical Computer Science, 256:1-2 (2001), 63-92.; Jensen K., Colored Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Springer, 1994.; K¨ohler-Bußmeier M., “Hornets: Nets within Nets combined with Net Algebra” (ICATPN’2009), Lecture Notes In Computer Science, 5606 (2009), 243-262.; 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.; Nehaniv C. L., “Asynchronous Automata Networks Can Emulate Any Synchronous Automata Network”, Int. J. of Algebra and Computation, 14:5-6 (2004), 719-739.; Petri C. A., Kommunikation mit Automaten. PhD thesis, Bonn Institute f¨ur Instrumentelle Mathematik, 1962.; Valk R., “Petri Nets as Token Objects: An Introduction to Elementary Object Nets” (ICATPN’98), Lecture Notes In Computer Science, 1420 (1998), 1-25.

  2. 2
  3. 3
  4. 4
  5. 5
  6. 6