The (i)Po(m)set Project is a research project at the crossroads of concurrency theory, automata theory, algebra, and geometry. You are at the page of its online seminar.

The seminar is organized by
Uli Fahrenberg,
Christian Johansen
and Krzysztof Ziemiański
and takes place on *zoom*.
If you want to participate,
send an email to ppos-owner@ml.lre.epita.fr
so that we can add you to our mailing list.
You will receive about one email per week in average:
seminar announcements, reminders, and the zoom link.

Talks generally last at most one hour, including time for questions.

See also the seminar's google calendar.

**Henning Basold**,
Universiteit Leiden, The Netherlands:
**Towards Higher Coalgebra: The Enriched Case**

There is an intricate link between concurrent systems and homotopy
theory, which has been exploited in the analysis of
higher-dimensional automata and distributed algorithms. The link
between computation and homotopy theory goes even further and my
long-term goal is to develop a general theory of higher coalgebras
in the context of (∞, n)-category theory for n ∈ {1,2}, which
provides an abstract account of this link. (∞, 1)-categories have
various models, among them topologically and simplicially enriched
categories. These are quite rigid models but they lend themselves to
concrete computations (see Lurie's Higher Topos Theory).

In this talk, I will first present some results on coalgebras that
arise from general enrichment, in particular we will look at
distributive laws, modal logic and effectful computations. We will
then go into the concrete case of topologically-enriched categories
to develop some homotopy theory of coalgebras in this concrete
setting. Particularly, we will focus on investigating modal logic
that is invariant under homotopy.

**Paul-André Melliès**,
IRIF, Paris, France:
TBA

**Uli Fahrenberg**,
LRE, Rennes/Paris, France:
Generating posets with interfaces

**Thomas Kahl**,
Universidade do Minho, Braga, Portugal:
Weak equivalence of higher-dimensional automata

**Mikołaj Bojańczyk**,
University of Warsaw, Poland:
About recognisability of graph languages

**Roman Kniazev**,
IRIF, Paris, France:
Simplicial models for epistemic logic (sprinkled with concurrency)

**Amar Hadzihasanovic**,
TalTech, Tallinn, Estonia:
The homotopy posets of a category

**Rob van Glabbeek**,
University of Edinburgh, Scotland:
Translating Petri nets to higher-dimensional automata

**Łukasz Mikulski**,
NCU, Toruń, Poland:
Relational structures for interval order semantics of concurrent systems

**Matt Earnshaw**,
TalTech, Tallinn, Estonia:
Monoidal languages

**Matteo Acclavio**,
SDU, Odense, Denmark:
The proof theory of pomsets

**Loïc Hélouët**,
IRISA, Rennes, France:
Waiting nets

**Jérémy Dubut-Kross**,
AIST, Tokyo, Japan:
Bisimulations and unfolding in P-accessible categorical models

**Marie Fortin**,
IRIF, Paris, France:
Logics and automata for Message Sequence Charts

**Tobias Kappé**,
Open Universiteit, The Netherlands:
Completeness and the finite model property for Kleene algebra, reconsidered

**Amazigh Amrane**,
EPITA Paris, France:
Series-parallel pomsets: automata and logic

**Sergio Rajsbaum**,
UNAM, Mexico and IRIF, Paris, France:
Unifying concurrent objects and distributed tasks: interval-linearizability

**Safa Zouari**,
NTNU Gjøvik, Norway:
Logical characterization of hh-bisimulation via open maps for HDA