Towards Global and Local Types for Adaptation

Bravetti, Mario; Carbone, Marco; Hildebrandt, Thomas; Lanese, Ivan; Mauro, Jacopo; Pérez, Jorge A.; Zavattaro, Gianluigi

doi:10.1007/978-3-319-05032-4_1

Cited by 12 publications

(18 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Works addressing adaptation for multiparty communications include [14], [15], [16], [17] and [18]. In the paper [14] global and session types are used to guarantee deadlockfreedom in a calculus of multiparty sessions with asynchronous communications.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…We do not need such conditions for progress, since communication is synchronous and adaptation is done in one single big step. The work [15] enhances a choreographic language with constructs defining adaptation scopes and dynamic code update; an associated endpoint language for local descriptions, and a projection mechanism for obtaining (low-level) endpoint specifications from (high-level) choreographies are also described. A typing discipline for these languages is left for future work.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

See 1 more Smart Citation

Data-driven adaptation for smart sessions

Bono

Coppo

Dezani‐Ciancaglini

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

This paper presents a formal framework of self-adaptation for multiparty sessions. The adaptation function contains the dynamic evolution policy, by prescribing how the session needs to reconfigure itself, based on critical changes in global data. A global type prescribes the overall communication choreography; its projections onto participants generate the monitors, which set-up the communication protocols. The key technical novelty of the calculus is the parallel operator for building global types and monitors, which allows the adaptation procedure to be rather flexible. The smart session is able to minimise its adaptation, by partially reconfiguring some of the communications and leaving all others unchanged, in case a part of the whole behaviour only needs to be modified. Furthermore, new participants can be added and/or some of the old participants can be removed. As a main result, we prove that this adaptation mechanism is safe, in order to guarantee that the communications will continue to evolve in a correct way after reconfiguration.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Section: Related Work and Conclusionmentioning

confidence: 99%

Data-driven adaptation for smart sessions

Bono

Coppo

Dezani‐Ciancaglini

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…Works addressing adaptation for multiparty communications include [1], [4], [9] and [6]. In paper [1] global and session types are used to guarantee deadlock-freedom in a calculus of multiparty sessions with asynchronous communications.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…We do not need such conditions for progress, since communication is synchronous and adaptation is done in one single big step. The work [4] enhances a choreographic language with constructs defining adaptation scopes and dynamic code update; an associated endpoint language for local descriptions, and a projection mechanism for obtaining (low-level) endpoint specifications from (high-level) choreographies are also described. A typing discipline for these languages is left for future work.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Parallel Monitors for Self-adaptive Sessions

Coppo

Dezani‐Ciancaglini

Venneri

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The paper presents a data-driven model of self-adaptivity for multiparty sessions. System choreography is prescribed by a global type. Participants are incarnated by processes associated with monitors, which control their behaviour. Each participant can access and modify a set of global data, which are able to trigger adaptations in the presence of critical changes of values. The use of the parallel composition for building global types, monitors and processes enables a significant degree of flexibility: an adaptation step can dynamically reconfigure a set of participants only, without altering the remaining participants, even if the two groups communicate.Comment: In Proceedings PLACES 2016, arXiv:1606.0540

show abstract

“…This survey reports about the attempt we did to address these shortcomings. In particular, here we present the contents of [2,3,1] at a level of detail that allows us to connect them and to discuss the consequences of relating their machinery (this will also lead to new ideas for future work). In particular, we present, in Section 2, a core calculus of adaptable processes expressing a variety of topologies/evolvability patterns and (un)decidability results of verification problems for them (the technical machinery is taken from [2,3]).…”

Section: Introductionmentioning

confidence: 99%

Towards Dynamic Updates in Service Composition

Bravetti

2015

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We survey our results about verification of adaptable processes. We present adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location of running processes, and so they are at the heart of the adaptation capabilities present in many modern concurrent systems. Adaptable processes have named scopes and are sensible to actions of dynamic update at runtime; this allows to express dynamic and static topologies of adaptable processes as well as different evolvability patterns for concurrent processes. We introduce a core calculus of adaptable processes and consider verification problems for them: first based on specific properties related to error occurrence, that we call bounded and eventual adaptation, and then by considering a simple yet expressive temporal logic over adaptable processes. We provide (un)decidability results of such verification problems over adaptable processes considering the spectrum of topologies/evolvability patterns introduced. We then consider distributed adaptability, where a process can update part of a protocol by performing dynamic distributed updates over a set of protocol participants. Dynamic updates in this context are presented as an extension of our work on choreographies and behavioural contracts in multiparty interactions. We show how update mechanisms considered for adaptable processes can be used to extend the theory of choreography and orchestration/contracts, allowing them to be modified at run-time by internal (self-adaptation) or external intervention.Comment: In Proceedings FOCLASA 2015, arXiv:1512.06947. arXiv admin note: substantial text overlap with arXiv:1411.379

show abstract

Towards Global and Local Types for Adaptation

Cited by 12 publications

References 17 publications

Data-driven adaptation for smart sessions

Data-driven adaptation for smart sessions

Parallel Monitors for Self-adaptive Sessions

Towards Dynamic Updates in Service Composition

Contact Info

Product

Resources

About