Paris Automata and Concurrency Theory Seminar

Presheaf automata offer a unifying framework for modeling computational processes using category theory. Starting from a base category equipped with two distinguished classes of morphisms, this formalism provides a general notion of automaton, along with related concepts such as runs, recognized words, regular and rational languages, and bisimilarity. This approach generalizes many automata-like formalisms, like finite state automata, Petri nets and push-down automata. In my talk, I will focus on higher dimensional automata and their variants, including those known before, like symmetric and event-consistent HDA, as well as some new ones. I will also dicuss their properties and relationship between them.

A historical perspective of how three different perspectives have been used to study how players can take advantage of correlations between their inputs for efficiency and privacy, starting with Shannon’s zero error information theory 1956 paper, Yao’s 1979 communication complexity paper, and Herlihy-Shavit 1993 distributed computing and topology paper.