Skip to main content

On Semantics for Mediator: A Coalgebraic Perspective

  • Conference paper
  • First Online:
Structured Object-Oriented Formal Language and Method (SOFL+MSVL 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11392))

  • 568 Accesses

Abstract

Mediator is a component-based modeling language where components and systems can be modeled separately and precisely. This paper aims to analyze the behavior of Mediator systems from a coalgebraic perspective, which is directly derived from the operational semantics of Mediator. Such a coalgebraic approach induces suitable notions of equivalence and refinement for Mediator.

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. Adámek, J., Bonchi, F., Hülsbusch, M., König, B., Milius, S., Silva, A.: A coalgebraic perspective on minimization and determinization. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 58–73. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28729-9_4

    Chapter  MATH  Google Scholar 

  2. Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)

    Article  MathSciNet  Google Scholar 

  3. Baier, C.: Probabilistic models for Reo connector circuits. J. UCS 11(10), 1718–1748 (2005)

    Google Scholar 

  4. Dorsch, U., Milius, S., Milius, S., Schröder, L., Wißmann, T.: Efficient coalgebraic partition refinement. In: CONCUR. LIPIcs, vol. 85, pp. 32:1–32:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  5. Goy, A.: Trace semantics via determinization for probabilistic transition systems. CoRR abs/1802.09084 (2018)

    Google Scholar 

  6. Jacobs, B.: Invariants, bisimulations and the correctness of coalgebraic refinements. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 276–291. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0000477

    Chapter  Google Scholar 

  7. Kerstan, H., König, B.: Coalgebraic trace semantics for probabilistic transition systems based on measure theory. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 410–424. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32940-1_29

    Chapter  MATH  Google Scholar 

  8. Kerstan, H., König, B.: Coalgebraic trace semantics for continuous probabilistic transition systems. Log. Methods Comput. Sci. 9(4), 1–34 (2013)

    Article  MathSciNet  Google Scholar 

  9. Li, Y., Sun, M.: Component-based modeling in mediator. In: Proença, J., Lumpe, M. (eds.) FACS 2017. LNCS, vol. 10487, pp. 1–19. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68034-7_1

    Chapter  Google Scholar 

  10. Milner, R.: Communication and concurrency. PHI Series in Computer Science. Prentice-Hall, Englewood cliffs (1989)

    MATH  Google Scholar 

  11. Rodrigues, C.J., Oliveira, J.N., Barbosa, L.S.: A single complete relational rule for coalgebraic refinement. Electr. Notes Theor. Comput. Sci. 259, 3–19 (2009)

    Article  Google Scholar 

  12. Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci 249, 3–80 (2000)

    Article  MathSciNet  Google Scholar 

  13. Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9(1:09), 1–27 (2013)

    MathSciNet  MATH  Google Scholar 

  14. Sokolova, A., de Vink, E.P., Woracek, H.: Coalgebraic weak bisimulation for action-type systems. Sci. Ann. Comp. Sci. 19, 93–144 (2009)

    MathSciNet  Google Scholar 

  15. Sun, M., Aichernig, B.K., Barbosa, L.S., Naixiao, Z.: A coalgebraic semantic framework for component based development in UML. Electr. Notes Theor. Comput. Sci. 122, 229–245 (2005)

    Article  MathSciNet  Google Scholar 

  16. Sun, M., Arbab, F., Baier, C.: Synthesis of Reo circuits from scenario-based interaction specifications. Sci. Comput. Program 76, 651–680 (2011)

    Article  Google Scholar 

  17. Meng, S., Barbosa, L.S.: On refinement of generic state-based software components. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 506–520. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27815-3_38

    Chapter  MATH  Google Scholar 

Download references

Acknowledgement

The work was partially supported by the National Natural Science Foundation of China under grant nos. 61772038, 61532019, 61202069 and 61272160.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meng Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, A., Wang, S., Li, Y., Sun, M. (2019). On Semantics for Mediator: A Coalgebraic Perspective. In: Duan, Z., Liu, S., Tian, C., Nagoya, F. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2018. Lecture Notes in Computer Science(), vol 11392. Springer, Cham. https://doi.org/10.1007/978-3-030-13651-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13651-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13650-5

  • Online ISBN: 978-3-030-13651-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics