Abstract
In this paper an extension of SDL by real-time assertions is suggested. A denotational compositional semantics in terms of timed high level Petri nets is given. This semantics allows to reason about timed SDL-specifications by simulation of the underlying high level nets as well as by unfolding these into timed low level nets and then applying analysis methods for timed Petri nets or temporal model checking. The approach is embedded in the MOBY-tool.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Amthor, H. Fleischhack, and J. Tapken: MOBY — more than a Tool for the Verification of SDL-Specifications, Research Paper, Universität Oldenburg, 1996.
F. Bause and P. Buchholz, Protocol Analysis Using a Timed Version of SDL, in J. Quemada, J. Mañas, and E. Vazquez (Eds.), Formal Description Techniques, III, pp. 269–285, North-Holland, 1991.
B. Berthomieu and M. Diaz, Modelling and Verification of Time Dependent Systems Using Time Petri Nets, IEEE Transactions on Software Engineering, Volume 17/3, pages 259–273 (1991).
E. Best, Partial Order Verification with PEP, Report HIB 26/96, Universität Hildesheim, 1996.
E. Best, R. Devillers, and J. G. Hall. The box calculus: a New Causal Algebra With Multi-Label Communication. In G. Rozenberg, (Ed.); Advances in Petri Nets 92, Volume 609 of Lecture Notes in Computer Science, pages 21–69. Springer, 1992.
E. Best, H. Fleischhack, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In G. De Michelis and M. Diaz, (Eds.), Application and Theory of Petri Nets 1995, Volume 935 of Lecture Notes in Computer Science, pages 103–118. Springer, 1995.
E. Best, H. Fleischhack, W. Fraczak, R. P., H. Mandel, and E. Pelz. An M-net Semantics of B(PN)2. In J. Desel, (Ed.), Structures in Concurrency Theory, Workshops in Computing, Springer, 1995.
CCITT. Specification and Description Language, CCITT Z.100, International Consultative Committee on Telegraphy and Telephony, Geneva, 1992.
J. Esparza. Model Checking Using Net Unfoldings, Science of Computer Programming, Volume 23, pages 151–195, Elsevier, 1994.
H. Fleischhack, and B. Grahlmann, Towards Compositional Verification of SDL Systems, Research Paper, 1997. (submitted)
B. Grahlmann and E. Best: PEP-More Than a Petri Net Tool. In T. Margaria and B. Steffen, (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Volume 1055 of Lecture Notes in Computer Science, pages 397–401, Springer, 1996.
J. Henriksen e.a., MONA: Monadic Second-Order Logic in Practice, in Brinksma, Cleaveland, Larsen, Margaria, and Steffen, (Eds.) TACAS '95, Tools and Algorithms for The Construction and Analysis of Systems, Volume 1019 of Lecture Notes in Computer Science, pages 89–110, Springer, 1995.
S. Leue, Specifying Real-Time Requirements for SDL Specifications — a Temporal Logic-Based Approach, Research Paper, University of Waterloo, Canada, 1996.
P. Merlin and D. Farber, Recoverability of Communication Protocols — Implication of a Theoretical Study, IEEE Transactions on Software Communications Vol. 24, 1036–1043 (1976).
L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of Lecture Notes in Computer Science, Springer, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fleischhack, H., Tapken, J. (1997). An M-Net semantics for a real-time extension of µSDL. In: Fitzgerald, J., Jones, C.B., Lucas, P. (eds) FME '97: Industrial Applications and Strengthened Foundations of Formal Methods. FME 1997. Lecture Notes in Computer Science, vol 1313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63533-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-63533-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63533-8
Online ISBN: 978-3-540-69593-6
eBook Packages: Springer Book Archive