Treffer: Complete axioms for stateless connectors
Title:
Complete axioms for stateless connectors
Authors:
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :98-113
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Abstraction, Abstracción, Algèbre processus, Process algebra, Algebra proceso, Calcul réparti, Distributed computing, Cálculo repartido, Coalgèbre, Coalgebra, Coordination, Coordinación, Forme normale, Normal form, Forma normal, Modélisation, Modeling, Modelización, Système multiagent, Multiagent system, Sistema multiagente, Sémantique dénotationnelle, Denotational semantics, Semántica denotacional, Sémantique opérationnelle, Operational semantics, Semantica operacional
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Department, University of Pisa, Italy
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17115999
Database:
PASCAL Archive
Weitere Informationen
The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in the literature, at different levels of abstraction. We focus on a basic algebra of connectors which is expressive enough to model, e.g., all the architectural connectors of Community. We first define the operational, observational and denotational semantics of connectors, then we show that the observational and denotational semantics coincide and finally we give a complete normal-form axiomatization.