Delayed-Choice Semantics for Pomset Families and Message Sequence Graphs

Research output: Contribution to book/conference proceedings/anthology/reportChapter in book/anthology/reportContributedpeer-review

Abstract

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.

Details

Original languageEnglish
Title of host publicationModelEd, TestEd, TrustEd
EditorsJoost-Pieter Katoen, Rom Langerak, Arend Rensink
PublisherSpringer, Berlin [u. a.]
Pages64-84
Number of pages21
ISBN (print)978-3-319-68269-3
Publication statusPublished - 2017
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 10500
ISSN0302-9743

External IDs

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

Keywords

Keywords

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

Library keywords