Skip to main content

A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13706))

Included in the following conference series:

  • 271 Accesses

Abstract

In 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004). https://doi.org/10.1017/S0960129504004153

    Article  MathSciNet  MATH  Google Scholar 

  2. Bernardo, M., Ciancarini, P., Donatiello, L.: On the formalization of architectural types with process algebras. In: Knight, J.C., Rosenblum, D.S. (eds.) ACM SIGSOFT, pp. 140–148. ACM (2000). https://doi.org/10.1145/355045.355064

  3. Bliudze, S., Sifakis, J.: The algebra of connectors - structuring interaction in BIP. IEEE Trans. Computers 57(10), 1315–1330 (2008). https://doi.org/10.1109/TC.2008.26

    Article  MathSciNet  MATH  Google Scholar 

  4. Bliudze, S., Sifakis, J.: A notion of glue expressiveness for component-based systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 508–522. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85361-9_39

    Chapter  Google Scholar 

  5. Bliudze, S., Sifakis, J.: Synthesizing glue operators from glue constraints for the construction of component-based systems. In: Apel, S., Jackson, E. (eds.) SC 2011. LNCS, vol. 6708, pp. 51–67. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22045-6_4

    Chapter  Google Scholar 

  6. Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci. 366(1–2), 98–120 (2006). https://doi.org/10.1016/j.tcs.2006.07.005

    Article  MathSciNet  MATH  Google Scholar 

  7. Bruni, R., Melgratti, H., Montanari, U.: A survey on basic connectors and buffers. In: Beckert, B., Damiani, F., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2011. LNCS, vol. 7542, pp. 49–68. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35887-6_3

    Chapter  Google Scholar 

  8. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5

    Book  MATH  Google Scholar 

  9. Fountoukidou, C.C., Pittou, M.: A formal algebraic approach for the quantitative modeling of connectors in architectures (2022). arXiv:2202.06594

  10. Hájek, P. (ed.): Metamathematics of Fuzzy Logic. Kluwer Academic Publishers (1998). https://doi.org/10.1007/978-94-011-5300-3

  11. Nawaz, M.S., Sun, M.: Using PVS for modeling and verification of probabilistic connectors. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 61–76. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31517-7_5

    Chapter  Google Scholar 

  12. Paraponiari, P., Rahonis, G.: Weighted propositional configuration logics: A specification language for architectures with quantitative features. Inform. Comput. 282 (2022). https://doi.org/10.1016/j.ic.2020.104647

  13. Rouland, Q., Hamid, B., Jaskolka, J.: Formalizing reusable communication models for distributed systems architecture. In: Abdelwahed, E.H., Bellatreche, L., Golfarelli, M., Méry, D., Ordonez, C. (eds.) MEDI 2018. LNCS, vol. 11163, pp. 198–216. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00856-7_13

    Chapter  Google Scholar 

  14. Sifakis, J.: Rigorous systems design. Found. Trends Signal Process. 6(4), 293–362 (2013). https://doi.org/10.1561/1000000034

    Article  Google Scholar 

  15. Sun, M., Zhang, X.: A relational model for probabilistic connectors based on timed data distribution streams. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 125–141. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00151-3_8

    Chapter  Google Scholar 

Download references

Acknowledgement

We are deeply grateful to the anonymous referees for their constructive comments and suggestions that brought the paper in its current form, especially regarding the results of Sect. 6.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Pittou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fountoukidou, C.C., Pittou, M. (2022). A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures. In: Poulakis, D., Rahonis, G. (eds) Algebraic Informatics. CAI 2022. Lecture Notes in Computer Science, vol 13706. Springer, Cham. https://doi.org/10.1007/978-3-031-19685-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19685-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19684-3

  • Online ISBN: 978-3-031-19685-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics