Choreography Automata

Abstract

Automata models are well-established in many areas of computer science and are supported by a wealth of theoretical results including a wide range of algorithms and techniques to specify and analyse systems. We introduce choreography automata for the choreographic modelling of communicating systems. The projection of a choreography automaton yields a system of communicating finite-state machines. We consider both the standard asynchronous semantics of communicating systems and a synchronous variant of it. For both, the projections of well-formed automata are proved to be live as well as lock-and deadlockfree.

Composing Communicating Systems, Synchronously

“…We now define, following [7,6], the synchronous semantics of systems of CFSMs, which is itself an FSA (differently from the asynchronous case, where the set of states can be infinite).…”

“…While we only discussed deadlock freedom, the same reasonings can be applied to other behavioural properties such as lock freedom [19,18,6] and liveness [23,6].…”

“…Such systems can be then analysed to check whether they enjoy relevant communication properties such as deadlock freedom, lock freedom, etc. (see, e.g., [16,24,7,20,6]).…”

Corinne, a Tool for Choreography Automata

“…In this paper we focus on choreography automata (c-automata) [4], which are an automata model belonging to the family described above. Essentially, c-automata are finite-state automata whose transitions are labelled by interactions representing point-to-point communications between a sender and a receiver.…”

“…Essentially, c-automata are finite-state automata whose transitions are labelled by interactions representing point-to-point communications between a sender and a receiver. Despite its simplicity, manually performing the constructions and analysis (such as the ones in [4]) on c-automata is tedious, error prone even for simple cases, and its complexity increases with the size of c-automata to the point that it becomes practically impossible even on moderately large instances.…”