Abstract
Timed SDL (TSDL) is a modified version of SDL designed for the examination of qualitative and quantitative system aspects within one model description. Because realistic communication protocols tend to be very large a program package was developed, which transforms a TSDL model into an internal representation of an equivalent Finite State Machine (FSM). This FSM representation can be efficiently analyzed by algorithms for qualitative and quantitative protocol analysis. In particular algorithms for partial state space exploration have shown to be very suitable. One of these algorithms is described in detail and is slightly improved. It is shown, that this kind of analysis leads to reasonable results, even for large models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajmone-Marsan. Stochastic Petri Nets: an Elementary Introduction. Advances in Petri Nets. GL Rozenberg (ed.), Lecture Notes in Computer Science 424, 1989, pp. 1–29.
M. Ajmone-Marsan, G. Balbo, G. Conte. A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Transactions on Computer Systems, Vol. 2, No. 2, Mai 1984, pp. 93–122.
F. Bause: No Way Out on The Timeless Trap. Petri Nets Newsletters 37, December 1990, pp. 4–8.
F. Bause, P. Buchholz: Protocol Analysis Using a Timed Version of SDL, Proceedings of the IFIP TC/WG 6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols, FORTE′90, November 1990, pp. 239–254.
F. Beiina, D. Hogrefe: The CCITT-Specification and Description Language SDL, Computer Networks and ISDN Systems, September 1989.
W. Bux et al: A Local-Area Network Based on a Reliable Token-Ring System, Proc. Int. Symposium on Local Computer Networks, (ed.) P. Ravasio, G. Hopkins, N. NafFah, North Holland 1982.
CCITT Z.100: CCITT SPECIFICATION AND DESCRIPTION LANGUAGE SDL, COM X - R 15 - E, Genf, March 1988.
D. D. Dimitrijevic, M.-S. Chen: An Integrated Algorithm for Probabilistic Protocol Verification and Evaluation, IBM Research Report RC 13901, August 1988.
D. Hogrefe: ESTELLE, LOTOS and SDL, Springer-Verlag, 1989.
ISO DIS9074 Estelle: A Formal Description Technique based on an Extended State Transition Model, 1987.
ISO DIS8807: Lotos: A Formal Description Technique, 1987.
U. Krieger, M. Sczittnick, B. Müller-Clostermann: Modeling and Analysis of Modern Telecommunication Networks by Markovian Techniques: Foundationsf Algorithms and an Example, IEEE Trans, on Comm., special issue on Computer-aided Modeling, 1990.
J. Cj S. Lui, R. R. Müntz: Evaluating Bounds on Steady State Availability of Repairable Systems from Markov Models, Proc. of the First Int. Workshop on the Numerical Solution of Markov Chains, Raleigh, 1990, pp. 469–489.
H. Rudin: Validation of a Token-Ring Protocol, Proc. Int. Symposium on Local Computer Networks, (ed.) P. Ravasio, G. Hopkins, N. Naffah, North Holland 1982.
H. Rudin: An Improved Algorithm for Estimating Protocol Performance, IBM Research Report, RZ 1314, April 1984.
C. H. West: Protocol Validation by Random State Exploration, IBM Research Reports, RZ 1482, Zurich, 1986 (also in: Proceedings of the 6th Int. Workshop on Protocol Specification, Testing and Verification, (ed.) B. Sarikaya, G. V. Bochmann).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bause, F., Buchholz, P. (1993). Qualitative and Quantitative Analysis of Timed SDL Specifications. In: Gerner, N., Hegering, HG., Swoboda, J. (eds) Kommunikation in Verteilten Systemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78091-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-78091-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56482-9
Online ISBN: 978-3-642-78091-2
eBook Packages: Springer Book Archive