In: 1990: Informatik, Informationen, Reporte, Nr. 7, pages 1-101. Berlin, Germany: Institut für Informatik und Rechentechnik, 1990.
Abstract: The behaviour of a distributed processing system can be described in terms of the set of global states of the system, where each global state consists of the set of states of the separate processing elements. One type of analysis is to consider whether any global state can be reached from any other state. This problem can be simplified by grouping together sets of data values, and treating the group as a component of a single state. In this paper, the behaviour of the control protocol of an ISDN communication network is modelled by a simplified Petri net, defined by the formal specification language SDL. The analysis is carried out using programs written in Modula 2.
Keywords: reachability analysis (in) distributed algorithm(s) (with) nets; grouping (of) data values; simplified net; specification (and) description language, SDL; Modula 2.