Automated Synthesis of Application-layer Connectors from Automata-based Specifications

DSpace Repository

Automated Synthesis of Application-layer Connectors from Automata-based Specifications

Details

Files for download

Find Full text There are no files associated with this item..

Overview of item record
Publication Paper in proceeding
Title Automated Synthesis of Application-layer Connectors from Automata-based Specifications
Author Autili, Marco ; Inverardi, Paola ; Mignosi, Filippo ; Spalazzese, Romina ; Tivoli, Massimo
Editor Adrian-Horia, Dediu ; Formenti, Enrico ; Martín-Vide, Carlos ; Truthe, Bianca
Date 2015
English abstract
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.
Conference
International Conference on Language and Automata Theory and Applications (March 2-6, 2015 : Nice, France)
DOI https://doi.org/10.1007/978-3-319-15579-1_1 (link to publisher's fulltext.)
Publisher Springer
Host/Issue Language and Automata Theory and Applications;
Series/Issue Lecture Notes in Computer Science;8977
Pages 3-24
Language eng (iso)
Subject Technology
Research Subject Categories::TECHNOLOGY
Handle http://hdl.handle.net/2043/21603 Permalink to this page
Link http://grammars.grlmc.com/LATA2015/... (external link to related web page)
Buy print http://www.bokfynd.nu/... (Search for reseller)
Facebook

This item appears in the following Collection(s)

Details

Search


Browse

My Account

Statistics