Cooperating Systems Based on Maximal Graphs in Semantic Schemas

In this paper we introduce the concept of cooperating system of semantic schemas. This structure is a tuple ({Si}i=1, E) (n ≥ 2) such that S1,. . .,Sn are distinct regular semantic schemas and E is a distinguished component. The formal computation in Si is a usual computation in a semantic schema and this kind of computation was defined in [3]. From the structural point of view E satisfies the rules of a semantic schema. An appropriate computation for E is defined and this computation describes the cooperation between S1,. . .,Sn. We exemplify these computations and several possible applications of this concept are discussed. Finally some open problems are shortly described. Key–Words: Peano algebra, strict partial order, semantic schema, interpretation, derivation in a semantic schema, cooperating system