Talks@DCC por José Proença, DCC-FCUP & CISTER

No próximo dia 15 de maio, pelas 13h30 na sala FC6 140 do DCC FCUP,  José Proença irá dar uma palestra intitulada "A pomset semantics for choreographies".


A palestra é organizada pelo DCC-FCUP.


Short Bio:

José Proença is an Assistant Professor at Faculty of Science of the University of Porto, and a researcher at the Research Center in Real-Time & Embedded Computing Systems, ISEP, in Portugal. His core research targets coordination mechanisms and formal methods in the context of Cyber-Physical Systems. He is actively involved in a NextGenerationEU project and in 1 FCT project. He currently belongs to the steering committee of 2 international conferences in fundamental computer science, he chaired the program committee of 6 international research venues with edited proceedings, edited 2 journal volumes, and was the member of 19 program-committees of international venues.



"A pomset semantics for choreographies"



Choreographic languages describe possible sequences of interactions among a set of agents. Typical models are based on languages or automata over sending and receiving actions. Pomsets provide a more compact alternative by using a partial order to explicitly represent causality and concurrency between these actions. However, pomsets offer no representation of choices, thus a set of pomsets is required to represent branching behaviour. For example, if an agent Alice can send one of two possible messages to Bob three times, one would need a set of 2 × 2 × 2 distinct pomsets to represent all possible branches of Alice’s behaviour. In this talk we propose an extension of pomsets, named branching pomsets, with a branching structure that can represent Alice’s behaviour using 2 + 2 + 2 ordered actions. We encode choreographies as branching pomsets and define well-formedness conditions on branching pomsets, inspired by multiparty session types, which are sufficient to show realisability of the represented communication protocol. We also present a prototype tool that implements our theory of branching pomsets. This is joint work with Luc Edixhoven, Sung-Shik Jongmans, and Ilaria Castellani, published in EPTCS and JLAMP.