Title: Compensating Automata

Abstract:
Automata offer an unstructured way of describing execution flows, providing high flexibility to programmers. To date there are no automata which fully support the unstructured description of flows having compensations. Compensations have lately gained importance due to their usefulness in modelling real-life processes where actions cannot be undone but rather counteracted. 
In this talk we give an overview of compensating automata, a formalism proposed for describing flows with compensations, thereby facilitating the monitoring and verification of compensable programs.