Results 1 
6 of
6
Interaction of Agents and Environments
"... . A new abstract model of interaction between agents and environments considered as objects of different types is introduced. Agents are represented by means of labelled transition systems considered up to bisimilarity. The equivalence of agents is characterised in terms of an algebra of behaviours ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. A new abstract model of interaction between agents and environments considered as objects of different types is introduced. Agents are represented by means of labelled transition systems considered up to bisimilarity. The equivalence of agents is characterised in terms of an algebra of behaviours which is a continuous algebra with approximation and two operations: nondeterministic choice and prefixing. Environments are introduced as agents supplied with an insertion function which takes the behaviour of an agent and the behaviour of an environment as arguments and returns the new behaviour of an environment. Arbitrary continuous functions can be used as insertion functions, and we use functions defined by means of rewriting logic as computable ones. The transformation of environment behaviours defined by the insertion function also defines a new type of agent equivalence  insertion equivalence. Two behaviours are insertion equivalent if they define the same transformation of an en...
Basic Protocols, Message Sequence Charts, and the Verification of Requirements Specifications
"... Message sequence charts are a widely used notation to express requirements specifications of multiagent systems. The semantics of message sequence charts can be defined algebraically in the theory of agents and insertion functions. Using this algebra, one can split message sequence chart scenarios ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Message sequence charts are a widely used notation to express requirements specifications of multiagent systems. The semantics of message sequence charts can be defined algebraically in the theory of agents and insertion functions. Using this algebra, one can split message sequence chart scenarios into sets of Hoare triples consisting of precondition, the specification of a finite process, and a postcondition. We refer to such triples as “basic protocols. ” In this paper, we discuss tools to prove properties of systems described as basic protocols, such as the completeness (at each of its stages the system behavior has a possible continuation) and consistency (at each stage the system behavior is deterministic) of the specification, or the correspondence of the specified behavior to given scenarios. Together, these tools constitute a powerful environment for the formal verification of requirements specifications expressed through message sequence charts. 1.
Insertion Modeling System And Constraint Programming
"... Abstract. The paper relates to practical aspects of insertion modeling. Insertion modeling system is an environment for the development of insertion machines, used to represent insertion models of distributed systems. The architecture of insertion machines and insertion modeling system IMS is presen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The paper relates to practical aspects of insertion modeling. Insertion modeling system is an environment for the development of insertion machines, used to represent insertion models of distributed systems. The architecture of insertion machines and insertion modeling system IMS is presented. Insertion machine for constraint programming is specified as an example, and as a starting point of ‘verifiable programming’ project. 1
ITHEA 133 COMPUTING SYSTEM OF PROGRAMS PROVING
"... Abstract: The paper is devoted to the methods of programs proving in the Insertion Modeling System IMS. Architecture and functional possibilities of IMS, the main notions of insertion modeling were presented in this work. Floyd’s insertion machine and the methods of the satisfiability checking, and ..."
Abstract
 Add to MetaCart
Abstract: The paper is devoted to the methods of programs proving in the Insertion Modeling System IMS. Architecture and functional possibilities of IMS, the main notions of insertion modeling were presented in this work. Floyd’s insertion machine and the methods of the satisfiability checking, and the usage of those methods for programs proving were described in the paper.
Implementation of PropagationBased Constraint Solver in IMS
"... Abstract. Article compiling the main ideas of creating propagationbased constraint solver, theoretical basis of constraint programming its implementation in IMS (Insertion Modeling System) and creating prototype of IMS constraint solver. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Article compiling the main ideas of creating propagationbased constraint solver, theoretical basis of constraint programming its implementation in IMS (Insertion Modeling System) and creating prototype of IMS constraint solver.
General Theory of Interaction and Cognitive Architectures
"... Abstract. The challenge of creating a reallife computational equivalent of the human mind is now attracting the attention of many scientific groups from different areas of cybernetics and Artificial Intelligence such as computational neuroscience, cognitive science, biologically inspired cognitive ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The challenge of creating a reallife computational equivalent of the human mind is now attracting the attention of many scientific groups from different areas of cybernetics and Artificial Intelligence such as computational neuroscience, cognitive science, biologically inspired cognitive architectures etc. The paper presents a new cognitive architecture based on insertion modeling, one of the paradigms of a general theory of interaction, and a basis for multiagent system development. Insertion cognitive architecture is represented as a multilevel insertion machine which realizes itself as a high level insertion environment. It has a center to evaluate the success of its behavior which is a special type agent that can observe the interaction of a system with external environment. The main goal of a system is achieving maximum success repeated. As an agent this machine is inserted into its external environment and has the means to interact with it. The internal environment of intelligent cognitive agent creates and develops its own model and the model of external environment. If the external environment contains other agents, they can be modeled by internal environment which creates corresponding machines and interprets those machines using corresponding drivers, comparing the behaviors of models and external agents. Insertion architecture is now under development on the base of Insertion modeling