Workshop on the Occasion of Jurriaan Rot's defence

Thursday, 15 October 2015, 10:00 – 12:30, Leiden, Lorentz Center@Snellius

Location

The workshop is going to take place at the Lorentz Center in the Snellius building in Leiden. This is located at Niels Bohrweg 1 on the 2nd floor. See here for a map and here for travel information.

Programme

Causal Trees, Finally

Ugo Montanari 1

Causal trees were introduced in 1989 by Philippe Darondeau and Pierpaolo Degano. The idea is to record causality dependencies in processes and in their actions. As such, causal trees sit between interleaving models and truly concurrent ones and they originate an abstract, event-based bisimulation semantics for causal processes, where, intuitively, minimal causal trees represent the semantic domain. In the talk, we substantiate this feeling by first defining a nominal, compositional operational semantics based on History-Dependent automata. Then we apply categorical techniques, based on presheaves and named-sets, showing that causal trees form the final coalgebra semantics of a suitable coalgebraic representation of causal behaviour.

Joint work with Roberto Bruni and Matteo Sammartino.

Introduction to Effectus Theory

Bart Jacobs 2

TBA

Distributive laws of monads over comonads can’t be formatted

Bartek Klin 3

Distributive laws of monads over comonads are the most powerful type of laws considered in bialgebraic operational semantics. For at least a decade it has been hoped that they would provide a general syntactic rule format for compositionality of bisimulation, generalizing both the formats of GSOS and safe ntree.

That hope was false. I will explain why.

  1. Dipartimento di Informatica, University of Pisa.

  2. Radboud University, Digital Security, Nijmegen.

  3. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw.