@INPROCEEDINGS{fleischhack_grahlmann:6/98,
        AUTHOR             = {Hans Fleischhack and Bernd Grahlmann},
        MONTH              = jun,
        BOOKTITLE          = {{Proceedings of ATPN'98 (Application and Theory
                               of Petri Nets)}},
        PUBLISHER          = {{Springer-Verlag}},
        SERIES             = {{Lecture Notes in Computer Science}},
        TITLE              = {{A Compositional Petri Net Semantics for SDL.}},
        YEAR               = {{1998}},
        PAGES              = {{144 -- 164}}, 
        NUMBER             = {{1420}},
        ABSTRACT           = {
In this paper a compositional high-level Petri net semantics for SDL
(Specification and Description Language) is presented. Emphasis is
laid on the modelling of dynamic creation and termination of processes
and of procedures - features, which are, for instance, essential for
typical client-server systems.

In a preliminary paper we have already shown that we are able to use
`state of the art' verification techniques by basing our approach on
M-nets (an algebra of high-level Petri nets). Therefore, this paper
concentrates on the details of the semantics.

A distinctive feature of the presented solution is that the `infinite
case' (infinitely many concurrent process and procedure instances as well
as unbounded capacities of input queues and channels) is covered.
                             },
        KEYWORDS           = {ARQ protocol, Compositionality, Concurrency,
                              Dynamic Processes, Infinity, Petri Net Semantics,
                              Procedures, SDL.}
}