A Semantics for Timed MSC

Operational Semantics for MSC'96

Recently, the ITU-standardised specification language Message Sequence Chart has been extended with constructs for more complete and structured specifications. The new version of the language is called MSC’96. Currently, research is performed on the extension of the formal semantics towards a semantics for MSC’96. In this article, we aim at explaining the basic ideas behind the formal semantics...

A Non–Interleaving Semantics for MSC

In this paper, we develop a non–interleaving semantics and an interleaving semantics for MSC’96 based on the model of families of partially ordered sets. These semantics are no denotational semantics, but are defined via translations of the textual syntax for MSC’96 into a process algebra. We show that the interleaving semantics agrees on BMSC with the standardized semantics for MSC’92, while t...

A Relative Timed Semantics for BPMN

We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion of relative time in the form of delays chosen non-deterministically from a range. We illustrate the application by an example. We also show some properties ...

An Execution Semantics for MSC-2000

Coalgebraic semantics for timed processes

We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a “time domain”, and we model processes by “timed transition systems”, which amount to partial monoid actions of the time domain or, equivalently, coalgebras for an “evolution comonad” generated by the time domain. All our examples of time domains satisfy a partial closure prop...