О мере изменения состояния коллектива взаимодействующих элементарных автоматов в дискретной среде

Досліджується поняття стану розподіленого в інформаційному середовищі дискретного обчислювального динамічного об’єкта, що складається з елементарних автоматів. Запропоновано геометричний підхід до визначення такого стану й виміру його зміни. Вивчаються динамічні властивості таких об’єктів.A collective of interacting stateless automata in a discrete geometric environment is considered as an integral automata-like computational dynamic object. We propose a geometric approach to determine the state and the measure of transition and analyze the dynamic properties of such objects

A state of a dynamic computational structure distributed in an environment: a model and its corollarie

In this work a collective of interacting stateless automata in a discrete geometric environment is considered as an integral automata-like computational dynamic object. For such distributed on the environment object different approaches to definition of the measure of state transition are possible. We propose an approach for defining what a state is.В работе коллектив взаимодействующих в дискретной среде автоматов рассматривается как цельный автоматоподобный вычислительный динамический объект. Для таких распределённых в среде объектов предлагается метод определения их функциональной эквивалентности, инвариантной относительно динамики.У роботі колектив взаємодіючих автоматів з одним станом у дискретному середовищі розглядається як цільний автоматоподібний обчислювальний динамічний об'єкт. Для таких розподілених по середовищу об'єктів пропонується метод визначення їхньої функціональної еквівалентності, інваріантної щодо динаміки

A state of a dynamic computational structure distributed in an environment: a model and its corollaries

Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial computation and space-time crystallography. For any computational model it is natural to define a functional equivalence of different but related computational structures. In the finite automata theory an example of such equivalence is automata homomorphism and, in particular, automata isomorphism. If we continue to stick to the finite automata theory, a fundamental question arise, what a state of a distributed computational structure is. This work is devoted to particular solution of the issue.Comment: 11 pages, 5 figure

Towards an infrastructure for preparation and control of intelligent automation systems

In an attempt to handle some of the challenges of modern production, intelligent automation systems offer solutions that are flexible, adaptive, and collaborative. Contrary to traditional solutions, intelligent automation systems emerged just recently and thus lack the supporting tools and infrastructure that traditional systems nowadays take for granted. To support efficient development, commissioning, and control of such systems, this thesis summarizes various lessons learned during years of implementation. Based on what was learned, this thesis investigates key features of infrastructure for modern and flexible intelligent automation systems, as well as a number of important design solutions. For example, an important question is raised whether to decentralize the global state or to give complete access to the main controller.Moreover, in order to develop such systems, a framework for virtual preparation and commissioning is presented, with the main goal to offer support for engineers. As traditional virtual commissioning solutions are not intended for preparing highly flexible, collaborative, and dynamic systems, this framework aims to provide some of the groundwork and point to a direction for fast and integrated preparation and virtual commissioning of such systems.Finally, this thesis summarizes some of the investigations made on planning as satisfiability, in order to evaluate how different methods improve planning performance. Throughout the thesis, an industrial material kitting use case exemplifies presented perspectives, lessons learned, and frameworks

The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena

The Internet is the most complex system ever created in human history. Therefore, its dynamics and traffic unsurprisingly take on a rich variety of complex dynamics, self-organization, and other phenomena that have been researched for years. This paper is a review of the complex dynamics of Internet traffic. Departing from normal treatises, we will take a view from both the network engineering and physics perspectives showing the strengths and weaknesses as well as insights of both. In addition, many less covered phenomena such as traffic oscillations, large-scale effects of worm traffic, and comparisons of the Internet and biological models will be covered.Comment: 63 pages, 7 figures, 7 tables, submitted to Advances in Complex System

Multi-Agent Credit Assignment in Stochastic Resource Management Games

Multi-Agent Systems (MAS) are a form of distributed intelligence, where multiple autonomous agents act in a common environment. Numerous complex, real world systems have been successfully optimised using Multi-Agent Reinforcement Learning (MARL) in conjunction with the MAS framework. In MARL agents learn by maximising a scalar reward signal from the environment, and thus the design of the reward function directly affects the policies learned. In this work, we address the issue of appropriate multi-agent credit assignment in stochastic resource management games. We propose two new Stochastic Games to serve as testbeds for MARL research into resource management problems: the Tragic Commons Domain and the Shepherd Problem Domain. Our empirical work evaluates the performance of two commonly used reward shaping techniques: Potential-Based Reward Shaping and difference rewards. Experimental results demonstrate that systems using appropriate reward shaping techniques for multi-agent credit assignment can achieve near optimal performance in stochastic resource management games, outperforming systems learning using unshaped local or global evaluations. We also present the first empirical investigations into the effect of expressing the same heuristic knowledge in state- or action-based formats, therefore developing insights into the design of multi-agent potential functions that will inform future work

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency