Revisiting Semantics of Interactions for Trace Validity Analysis

by   Erwan Mahe, et al.

Interaction languages such as UML sequence diagrams are often associated with a formal semantics by means of translations into formalisms such as automatas or Petri nets. In contrast, we propose an approach without any references to any other behavioral formalisms. We define an operational approach to compute the semantics of interactions. The principle is to identify which elementary communication actions can be immediately executed, and then to compute, for each of those actions, a new interaction representing the possible continuations to its execution. We also define an algorithm for checking the validity of execution traces, i.e. checking whether or not the trace belongs to the semantics of the considered interaction. Algorithms for semantics computation and trace validity are analyzed by means of some experiments.


page 1

page 2

page 3

page 4


A small-step approach to multi-trace checking against interactions

Interaction models describe the exchange of messages between the differe...

A structural operational semantics for interactions with a look at loops

Message Sequence Charts Sequence Diagrams are graphical models that ...

Complete trace models of state and control

We consider a hierarchy of four typed call-by-value languages with eithe...

A quantitative extension of Interval Temporal Logic over infinite words

Model checking for Halpern and Shoham's interval temporal logic HS has b...

Robust and efficient validation of the linear hexahedral element

Checking mesh validity is a mandatory step before doing any finite eleme...

Unitless Frobenius quantales

It is often stated that Frobenius quantales are necessarily unital. By t...

Branching Pomsets for Choreographies

Choreographic languages describe possible sequences of interactions amon...