Delayed choice for process algebra with abstraction

The delayed choice is an operator which serves to combine linear time and branching time within one process algebra. We study this operator in a theory with abstraction, more precisely, in a setting considering branching bisimulation. We show its use in scenario specifications and in verification to reduce irrelevant branching structure of a process

Syntax requirements of message sequence charts

A set of syntax requirements of MSC is discussed and formalized. The treatment is restricted to Basic MSCs without conditions. Syntax requirements of communication events in Basic MSCs are discussed and formalized. The formalization is syntax directed and based on functions and predicates