Complete Axioms for Stateless Connectors
Autor: | Ivan Lanese, Roberto Bruni, Ugo Montanari |
---|---|
Přispěvatelé: | José Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten, BRUNI R., LANESE I., MONTANARI U. |
Rok vydání: | 2005 |
Předmět: |
Theoretical computer science
Connectors Normal form Algebraic semantics Axiomatization Monoidal categories Computer science Programming language CONNECTORS Coalgebra Process calculus NORNAL FORMS MONOIDAL CATEGORIES Monoidal category ALGEBRAIC SEMANTICS computer.software_genre Operational semantics Elementary algebra AXIOMATIZATION TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Denotational semantics Mutual exclusion computer Axiom Abstraction (linguistics) |
Zdroj: | Algebra and Coalgebra in Computer Science ISBN: 9783540286202 CALCO |
DOI: | 10.1007/11548133_7 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |