Malmö University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automated Synthesis of Application-layer Connectors from Automata-based Specifications
Malmö högskola, Faculty of Technology and Society (TS).ORCID iD: 0000-0003-0326-0556
Show others and affiliations
2015 (English)In: Language and Automata Theory and Applications, Springer, 2015, p. 3-24Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
Springer, 2015. p. 3-24
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8977
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mau:diva-12720DOI: 10.1007/978-3-319-15579-1_1Scopus ID: 2-s2.0-84928794171Local ID: 21603OAI: oai:DiVA.org:mau-12720DiVA, id: diva2:1409767
Conference
International Conference on Language and Automata Theory and Applications, Nice, France (March 2-6, 2015)
Available from: 2020-02-29 Created: 2020-02-29 Last updated: 2024-02-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopushttp://grammars.grlmc.com/LATA2015/

Authority records

Spalazzese, Romina

Search in DiVA

By author/editor
Spalazzese, Romina
By organisation
Faculty of Technology and Society (TS)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 26 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf