The concept of a digital ecosystem (DE) has been used to explore scenarios in which multiple online services and resources can be accessed by users without there being a single point of control, which can be used to effectively serialise their interactions. We argue in this paper that this weak coupling between services places additional demands on the modelling of compensation and recovery management in long-running transactions over traditional SOC related formalisms. We describe an adaptation of Shields' vector languages, in that the synchronisation constraint is removed (no shared actions), as a formal semantics for a transaction in terms of the common ordering constraints on the underlying interactions between its participants. The notation afforded by the so-called transaction languages captures the invocations on each participant service (online resource), and at each point during execution, across the whole transaction. Concurrency is modelled explicitly through a notion of independence, which is lifted onto tuples of sequences (one for each participant of the transaction) rather than individual sequences, as in Mazurkiewicz trace languages or events, as in the event structures model. Participating subcomponents execute concurrently and failure of one or more causes the recovery of the whole transaction. Compensations are triggered immediately upon failure and concurrent forward actions are compensated concurrently. We highlight the benefits of our true-concurrent approach in the context of DEs and outline connections of transaction languages to other partial order models. Further, we discuss how our approach supports forward recovery in that recovering the whole transaction is avoided wherever possible.
