Abstract
The application of formal methods in protocol verification is of great importance, especially in the area of safety critical systems. Formal methods, however, are scarcely used in industrial practice today because they are hardly to integrate into the conventional system design and require a high effort in computing. We describe the implementation and application of a tool that handles formal specifications written in the process calculus CCS. The automatic verification process is based on binary decision diagrams to efficiently cope with state explosion problems. As an verification example we use a model of the CSMA/CD protocol including propagation delay effects on the transmission medium.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Milner: “Communication and Concurrency”, Prentice Hall International Series in Computer Science, ISBN 0-13-114984-9.
R. Milner, J. Parrow, D. Walker: “A calculus of mobile processes”, in Information and Computing 100, 1992, pp. 1–77.
R. Cleaveland, J. Parrow, B. Steffen: “The concurrency workbench: A semanticsbased tool for the verification of concurrent systems”, ACM Transactions on Programming Languages and Systems, 15(1):36–72, January 1993.
B. Krämer, G. Henze et al.: “Deriving ANSAware Applications from Formal Specifications”, Proceedings of SDPS'95, 1995.
Randal E. Bryant: “Graph-based Algorithms for Boolean function manipulation”, IEEE Trans. Computers, C-35(8): 677–691, August 1986.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, J. Hwang: “Symbolic Model Checking: 102° states and beyond”. Technical Report, CMU, 1989.
K. L. McMillan: “Symbolic Model Checking: An approach to the State Explosion Problem.”, PhD thesis, Carnegie Mellon Univeristy, 1992.
R. Enders, T. Filkorn, D. Taubner: “Generating BDDs for symbolic model checking in CCS”, in Distributed Computing, 1993, 6:155–164.
K. Gotthardt, I. Scheler: “Formale Verifikation von Vielfach-Zugriffsprotokollen in CCS” GI-Fachtagung Softwaretechnik, Braunschweig, 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lichtenecker, R., Gotthardt, K., Zalewski, J. (1998). Automated verifications of communication protocols using CCS and BDDs. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_771
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_771
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive