Publikationer från Malmö universitet
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Automated Synthesis of Application-layer Connectors from Automata-based Specifications
Malmö högskola, Fakulteten för teknik och samhälle (TS).ORCID-id: 0000-0003-0326-0556
Visa övriga samt affilieringar
2015 (Engelska)Ingår i: Language and Automata Theory and Applications, Springer, 2015, s. 3-24Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to cooperate in order to reach some common goal even though they meet dynamically and do not have a priori knowledge of each other. Despite numerous efforts have been done in the literature, the automated and run-time interoperability is still an open challenge for such environment. We consider interoperability as the ability for two Networked Systems (NSs) to communicate and correctly coordinate to achieve their goal(s). In this paper, we report the main outcomes of our past and recent research on automatically achieving protocol interoperability via connector synthesis. We consider application-layer connectors by referring to two conceptually distinct notions of connector: {\em coordinator} and {\em mediator}. The former is used when the NSs to be connected are already able to communicate but they need to be specifically coordinated in order to reach their goal(s). The latter goes a step forward representing a solution for both achieving correct coordination and enabling communication between highly heterogeneous NSs. In the past, most of the works in the literature described efforts to the automatic synthesis of coordinators while, in recent years the focus moved also to the automatic synthesis of mediators. By considering our past experience on the automatic synthesis of coordinators and mediators as a baseline, we conclude by overviewing a formal method for the automated synthesis of mediators that allows to relax some assumptions state-of-the-art approaches rely on, and characterize the necessary and sufficient interoperability conditions that ensure the mediator existence and correctness.

Ort, förlag, år, upplaga, sidor
Springer, 2015. s. 3-24
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8977
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:mau:diva-12720DOI: 10.1007/978-3-319-15579-1_1Scopus ID: 2-s2.0-84928794171Lokalt ID: 21603OAI: oai:DiVA.org:mau-12720DiVA, id: diva2:1409767
Konferens
International Conference on Language and Automata Theory and Applications, Nice, France (March 2-6, 2015)
Tillgänglig från: 2020-02-29 Skapad: 2020-02-29 Senast uppdaterad: 2024-02-05Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopushttp://grammars.grlmc.com/LATA2015/

Person

Spalazzese, Romina

Sök vidare i DiVA

Av författaren/redaktören
Spalazzese, Romina
Av organisationen
Fakulteten för teknik och samhälle (TS)
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 19 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf