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 deadlock-free.
机构:
Tel Aviv Univ, Buchmann Mehta Sch Mus, Musicol Programme, Tel Aviv, Israel
Tel Aviv Univ, David & Yolanda Katz Fac Arts, Buchmann Mehta Sch Mus, IL-6997801 Tel Aviv, IsraelTel Aviv Univ, Buchmann Mehta Sch Mus, Musicol Programme, Tel Aviv, Israel