Distributed systems with simple concept graphs

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article a theory of distributed systems consisting of formal contexts which was introduced by Barwise and Seligman is translated to distributed systems consisting of concept graphs. The aim is to construct for every distributed system a channel consisting of a concept graph representing the distributed system and a set concept graph morphisms representing the relation between the parts of the system and the whole system. To reach this aim two operations for constructing new concept graphs, the semiproduct and the quotient by an invariant, are introduced. These operations are the basis for constructing the concept graph of the channel which represents a distributed system as a whole.

Cite

CITATION STYLE

APA

Malik, G. (2003). Distributed systems with simple concept graphs. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2746, pp. 257–270). Springer Verlag. https://doi.org/10.1007/978-3-540-45091-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free