2024-10-18: Clovis Eberhart (MSP)

Wed, 16 Oct 2024 15:45:01 +0000

Clovis Eberhart (MSP)

A Compositional Approach to Verification Models

Abstract

We will present a compositional approach to graph-like verification models (e.g., parity games, Markov decision processes, or Petri nets) based on open structures. Such open structures are graphs with potentially dangling edges called open ends, and which form interfaces along which open structures can be composed. We thus define a syntactic category of interfaces and open structures between them. We then define a semantic category representing relevant information about the structure (e.g., a category of probabilistic rewards). Finding an interpretation functor from the syntactic category to the semantic one shows that these structures' semantics can be computed compositionally. (This is joint work with Kazuki Watanabe, Kazuyuki Asada, Ichiro Hasuo, and Serge Lechenne.)

2024-10-18 13:00:00 UTC
LT714 and Online