2012
DOI: 10.1109/tsc.2010.57
|View full text |Cite
|
Sign up to set email alerts
|

Reducing Adapter Synthesis to Controller Synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
32
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(32 citation statements)
references
References 26 publications
0
32
0
Order By: Relevance
“…The approach works by assigning to loops a fixed number of iterations, whereas we do not impose any restriction, and peers may loop infinitely. Gierds and colleagues [18] present an approach for specifying behavioural adapters based on domain-specific transformation rules that reflect the elementary operations that adapters can perform. The authors also present a novel way to synthesise complex adapters that adhere to these rules by consistently separating data and control, and by using existing controller synthesis algorithms.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The approach works by assigning to loops a fixed number of iterations, whereas we do not impose any restriction, and peers may loop infinitely. Gierds and colleagues [18] present an approach for specifying behavioural adapters based on domain-specific transformation rules that reflect the elementary operations that adapters can perform. The authors also present a novel way to synthesise complex adapters that adhere to these rules by consistently separating data and control, and by using existing controller synthesis algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…All interactions pass through the adapter, which acts as an orchestrator and makes the involved peers work correctly together by compensating for mismatch. Many solutions have been proposed since the seminal work by Yellin and Strom [32], see, e.g., [6,8,30,24,18,19].…”
Section: Introductionmentioning
confidence: 99%
“…The approach works by assigning to loops a fixed number of iterations, whereas we do not impose any restriction, and peers may loop infinitely. Gierds and colleagues [12] present an approach for specifying behavioural adapters based on domain-specific transformation rules that reflect the elementary operations that adapters can perform. The authors also present a novel way to synthesise complex adapters that adhere to these rules by consistently separating data and control, and by using existing controller synthesis algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…All interactions pass through the adapter, which acts as an orchestrator and makes the involved peers work correctly together by compensating for mismatch. Many solutions have been proposed since the seminal work by Yellin and Strom [22], see, e.g., [3,5,20,15,12,13]. Most existing approaches assume that peers interact using synchronous communication, that is rendez-vous synchronizations.…”
Section: Introductionmentioning
confidence: 99%
“…And, while interoperability in the early days of distributed systems was essentially relying on the definition of standards, the increasing complexity and diversity of networked systems has led to the introduction of various interoperability solutions [3]. In particular, today's solutions allow connecting networked systems in a nonintrusive way, i.e., without requiring to modify the systems [4], [5], [6], [7], [8]. These solutions typically use intermediary software entities whose name differ in the literature, e.g., mediators [9], wrappers [4], mediating adapters [5], or binding components [10].…”
Section: Introductionmentioning
confidence: 99%