Message sequence charts (MSC) is a graphical and textual
formalism suitable for specifying distributed communication. It
consists of the MSC and a High-level MSC (HMSC). The formalism
incorporates the possibility of specifying time in designed
systems. There arise severe problems regarding timing
constraints in MSC, such as computation of minimal network.
First attempts to solve the problems using various approaches
have been presented.
In this thesis, we analyze different approaches to time
extension of MSC. As most suitable appears to be the approach
using labeled partially ordered sets. An extension to this
approach is provided to handle computation of minimal network
in MSC formalism with coregions and constraints in HMSC.
Restriction to proper constraint specification is given, which
rules out ambiguous and erroneous constraint specifications.
Algorithm pseudocodes for checking proper time constraints are
provided.