Delayed-Choice Semantics for Pomset Families and Message Sequence Graphs

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in Buch/Sammelband/GutachtenBeigetragenBegutachtung


Message sequence charts (MSCs) are diagrams widely used to describe communication scenarios. Their higher-order formalism is provided by graphs over MSCs, called message sequence graphs (MSGs), which naturally induce a non-interleaving linear-time semantics in terms of a pomset family. Besides this pomset semantics, an operational semantics for MSGs was standardized by the ITU-T as an interleaving branching-time semantics using a process-algebraic approach. A key ingredient in the latter semantics is delayed choice, formalizing that choices between communication scenarios are only made when they are inevitable. In this paper, an approach towards branching-time semantics for pomset families that follows the concept of delayed choice is proposed. First, transition-system semantics are provided where global states comprise cuts of pomsets represented either by suffixes or prefixes of family members. Second, an event-structure semantics is presented those benefit is to maintain the causal dependencies of events provided by the pomset family. These semantics are also investigated in the context of pomset families generated by MSGs.


TitelModelEd, TestEd, TrustEd
Redakteure/-innenJoost-Pieter Katoen, Rom Langerak, Arend Rensink
Herausgeber (Verlag)Springer, Berlin [u. a.]
ISBN (Print)978-3-319-68269-3
PublikationsstatusVeröffentlicht - 2017


ReiheLecture Notes in Computer Science, Volume 10500

Externe IDs

Scopus 85032696709
ORCID /0000-0002-5321-9343/work/142236674



  • Delayed-Choice Semantics, Branching-time Semantics, Process Algebraic Approach, Pomset Families, Message Sequence Graphs, Ed Brinksma