Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3019612.3019625acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Efficient compensation handling via subjective updates

Published: 03 April 2017 Publication History

Abstract

Programming abstractions for compensation handling and dynamic update are crucial in specifying reliable interacting systems, such as Collective Adaptive Systems (CAS). Compensations and updates both specify how a system reacts in response to exceptional events. Prior work showed that different semantics for compensation handling can be encoded into a calculus of adaptable processes with objective updates, in which a process is reconfigured by its context. This paper goes further by considering subjective updates, in which, intuitively, a process reconfigures itself. A calculus of adaptable processes with subjective update its introduced, and its expressivity is assessed by encoding two semantics for compensation handling. The resulting encodings are more efficient than those using objective updates: they require less computational steps.

References

[1]
Y. A. Alrahman, R. De Nicola, and M. Loreti. On the power of attribute-based communication. In Proc. of FORTE 2016, volume 9688 of LNCS, pages 1--18. Springer, 2016.
[2]
M. Bravetti, C. D. Giusto, J. A. Pérez, and G. Zavattaro. Adaptable processes. Logical Methods in Computer Science, 8(4), 2012.
[3]
L. Cardelli and A. D. Gordon. Mobile ambients. Theor. Comput. Sci., 240(1):177--213, 2000.
[4]
G. Castagna, J. Vitek, and F. Z. Nardelli. The seal calculus. Inf. Comput., 201(1):1--54, 2005.
[5]
F. Damiani, M. Viroli, D. Pianini, and J. Beal. Code mobility meets self-organisation: A higher-order calculus of computational fields. In Proc. of FORTE 2015, volume 9039 of LNCS, pages 113--128. Springer, 2015.
[6]
R. De Nicola, M. Loreti, R. Pugliese, and F. Tiezzi. A formal approach to autonomic systems programming: The SCEL language. TAAS, 9(2):7:1--7:29, 2014.
[7]
J. Dedeić, J. Pantović, and J. A. Pérez. On compensation primitives as adaptable processes. In EXPRESS/SOS 2015, volume 190 of EPTCS, pages 16--30, 2015.
[8]
D. Gorla. Towards a unified approach to encodability and separation results for process calculi. Inf. Comput., 208(9):1031--1053, 2010.
[9]
I. Lanese, C. Vaz, and C. Ferreira. On the expressive power of primitives for compensation handling. In Proc. of ESOP 2010, volume 6012 of LNCS, pages 366--386. Springer, 2010.
[10]
I. Lanese and G. Zavattaro. Decidability results for dynamic installation of compensation handlers. In COORDINATION, volume 7890 of LNCS, pages 136--150. Springer, 2013.
[11]
R. Milner. Communication and concurrency. PHI Series in computer science. Prentice Hall, 1989.
[12]
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Inf. Comput., 100(1):1--40, 1992.
[13]
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher Order Paradigms. PhD thesis, University of Edinburgh, 1992.

Cited By

View all
  • (2021)On primitives for compensation handling as adaptable processesJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2021.100675(100675)Online publication date: Mar-2021

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '17: Proceedings of the Symposium on Applied Computing
April 2017
2004 pages
ISBN:9781450344869
DOI:10.1145/3019612
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 April 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. compensation handling
  2. concurrency
  3. dynamic update
  4. expressiveness
  5. process calculi
  6. semantics of programming languages

Qualifiers

  • Research-article

Conference

SAC 2017
Sponsor:
SAC 2017: Symposium on Applied Computing
April 3 - 7, 2017
Marrakech, Morocco

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)On primitives for compensation handling as adaptable processesJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2021.100675(100675)Online publication date: Mar-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media