Algebra of behavior transformations and its applications

The model of interaction of agents and environments is considered. Both agents and environments are characterized by their behaviors represented as the elements of continuous behavior algebra, a kind of the ACP with approximation relation, but in addition each environment is supplied by an insertion function, which takes the behavior of an agent and the behavior of an environment as arguments and return a new behavior of this environment. Each agent can be considered as a transformer of environment behaviors and a new kind of equivalence of agents weaker than bisimulation is defined in terms of the algebra of behavior transformations. Arbitrary continuous functions can be used as insertion functions and rewriting logic is used to define computable ones. The theory has applications for studying distributed computations, multi agent systems and semantics of specification languages.

[1]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[2]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[3]  David Gilbert,et al.  Interaction of agents and environments , 1998 .

[4]  Peter Aczel,et al.  Infinite trees and completely iterative theories: a coalgebraic view , 2003, Theor. Comput. Sci..

[5]  A. A. Letichevskii.  Algebras with approximation and recursive data structures , 1987 .

[6]  V. M. Glushkov,et al.  Automata theory and formal microprogram transformations , 1965 .

[7]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[8]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[9]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[12]  Markus Roggenbach,et al.  Towards a unified view of bisimulation: a comparative study , 2000, Theor. Comput. Sci..

[13]  Yu. V. Kapitonova,et al.  Insertion Programming , 2003 .

[14]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[15]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[16]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[17]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[18]  V. M. Glushkov,et al.  Theory of Algorithms and Discrete Processors , 1969 .

[19]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

[20]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[21]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.