Abstract
AbstractIn this paper, we propose an algebraic formalization of connectors in the quantitative setting. We firstly present a weighted Algebra of Interactions over a set of ports and a commutative and idempotent semiring, which is proved sufficient for modeling well-known coordination schemes in the weighted setup. In turn, we study a weighted Algebra of Connectors over a set of ports and a commutative and idempotent semiring, which extends the former algebra with types that describe Rendezvous and Broadcast synchronization. We show the expressiveness of the algebra by modeling several weighted connectors, and we provide conditions for proving a concept of congruence relation between weighted connectors.KeywordsWeighted Algebra of InteractionsWeighted Algebra of ConnectorsCoordination schemesArchitectures
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
