Abstract
Dynamic compensation installation allows for easier specification of fault handling in complex interactive systems since it enables to update the compensation policies according to run-time information. In this paper we show that in a simple π-like calculus with static compensations the termination of a process is decidable, but it is undecidable in one with dynamic compensations. We then consider three commonly used patterns for dynamic compensations, showing that process termination is decidable for parallel and replacing compensations while it remains undecidable for nested compensations. © 2013 IFIP International Federation for Information Processing.
Cite
CITATION STYLE
Lanese, I., & Zavattaro, G. (2013). Decidability results for dynamic installation of compensation handlers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7890 LNCS, pp. 136–150). https://doi.org/10.1007/978-3-642-38493-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
