Modelling and analysing the SDL description of the ISDN-DSS1 protocol

Authors:
Nisse Husberg;Teemu Tynjälä;Kimmo Varpaaniemi
Affiliations:
Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland;Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland;Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland
Venue:
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Year:
2000

Citing 4
Cited 1

Transformations and decompositions of nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
An Analysis of Bitstate Hashing

Formal Methods in System Design
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Analysis of Petri Nets with a Dynamic Priority Method

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets

Automatic formal model generation and analysis of SDL

SDL'03 Proceedings of the 11th international conference on System design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The modelling of a telecommunication protocol, ISDN-DSS1, defined using SDL, is described and the problems and methods used are discussed. The formalism used for the model is a high-level Petri net, the PROD input language which is close to a predicate/transition net. The influence of the model on the reachability analysis is also discussed with a special attention on the use of priorities and reduction methods. Finally, further development of tools which aid in modelling and analysis of this class of systems is discussed.