Abstract Session-based concurrency is a type-based approach to the analysis of message-passing programs. These programs may be specified in an operational or declarative style: former defines how interactions are properly structured; latter governing conditions for correct interactions. In this paper, we study rigorous relationships between and models session-based concurrency. We develop encod...

The homotopy hypothesis was originally stated by Grothendieck [13] : topological spaces should be “equivalent” to (weak) ∞-groupoids, which give algebraic representatives of homotopy types. Much later, several authors developed geometrizations of computational models, e.g. for rewriting, distributed systems, (homotopy) type theory etc. But an essential feature in the work set up in concurrency ...

Brand and Zafiropulo's notion of Communicating Finite-State Machines (CFSMs) provides a succinct powerful model message-passing concurrency, based around channels. However, major variant concurrency is not readily captured by CFSMs: the actor model. In this work, we define CFSMs, called Actor Automata, to capture as provided Erlang: with mailboxes, from which messages are received according rep...