Summary
Finite transition systems can easily be represented by binary decision diagrams (BDDs) through the characteristic function of the transition relation. Burch et al. have shown how model checking of a powerful version of the μ-calculus can be performed on such BDDs. In this paper we show how a BDD can be generated from elementary finite transition systems given as BDDs by applying the CCS operations of parallel composition, restriction, and relabelling. The resulting BDDs only grow linearly in the number of parallel components. This way bisimilarity checking can be performed for processes out of the reach of conventional process algebra tools.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bryant RE: Graph-based algorithms for boolean function manipulation. IEEE Trans Comput C-35 8:677–691 (1986)
Burch JR, Clarke EM, McMillan KL, Dill DL, Hwang LJ: Symbolic model checking: 1020 states and beyond. In: Proceedings of the 5th IEEE Symp. on Logic in Computer Science, Philadelphia 1990. Computer, Society Press, 1990, pp 428–439
Cleaveland R, Parrow J, Steffen B: The concurrency workbench. In: Sifakis J (ed) Automatic verification methods for finite state systems. Proceedings, Grenoble 1989. Lect Notes Comput Sci, vol 407. Springer, Berlin Heidelberg New York 1990, pp 24–37
de Simone R, Vergamini D: Abord auto. Rapports Techniques 111, INRIA, Sophia Antipolis 1989
Emerson EA, Lei C-L: Efficient model checking in fragments of the propositional mu-calculus. In: Proc. of the First Annual Symp. on Logic in Computer Science. Computer Society Press, 1986, pp 267–278
Estenfeld K, Schneider H-A, Taubner D, Tidén E: Computer aided verification of parallel processes. In: Pfitzmann A, Raubold E (eds) VIS '91 Verläßliche Informationssysteme. Proceedings, Darmstadt 1991. Informatik Fachberichte, vol 271. Springer, Berlin Heidelberg New York 1991, pp 208–226
Fernandez J-C: An implementation of an efficient algorithm for bisimulation equivalence. Sci, of Comput Program 13:219–236 (1989/90)
Filkorn T: Unifikation in endlichen Algebren und ihre Integration in Prolog. Master's Thesis, Techn. Universität München 1988
Fischer S, Scholz A, Taubner D: Verification in process algebra of the distributed control of track vehicles — A case study. In: Proceedings of CAV'92, Workshop on Computer-Aided Verification, Montreal 1992
Groote JF, Vaandrager F: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Automata, languages and programming, ICALP'90. Lect Notes Comput Sci, vol 443. Springer, berlin Heidelberg New York 1990
Milner R: Communication and concurrency. Prentice Hall, New York 1989
Stirling C, Walker D: Local model checking in the modal mucalculus. In: Díaz J, Orejas F (eds) TAPSOFT '89. vol 1. Proceedings, Barcelona 1989. Lect Notes Comput Sci, vol 351. Springer, Berlin Heidelberg New York 1989, pp 369–383
Taubner D: Finite representations of CCS and TCSP programs by automata and petri nets. Lect Notes Comput Sci 369:61–94 (1989)
Author information
Authors and Affiliations
Additional information
Reinhard Enders graduated from the Technical University in Munich with a Diploma in mathematics and computer science in 1978. From 1977 to 1984 he was employed by Siemens, working in computer linguistics and expert systems. From 1984 to 1988 he worked at ECRC on Prolog extensions. In Autmn 1988 he joined Siemens and is developping the constraint extension of a new Prolog product.
Thomas Filkorn received the computer science degree and the Ph.D. degree, both from the Technical University of Munich. Since 1992 he works at Siemens' Corporate Research and Development on symbolic algorithms and methods for the verification of finite state systems.
Dirk Taubner received his Ph.D. in informatics at the Technical University of Munich in 1988. He investigated which sublanguages of process algebra could be represented finitely by automata and Petri nets. From 1989 through 91 he worked at Siemens' Corporate Research and Development where he led a project on computer-aided verification of parallel processes. This paper presents part of the work of that project. Currently he works on commercial software engineering for a software consulting company.
Rights and permissions
About this article
Cite this article
Enders, R., Filkorn, T. & Taubner, D. Generating BDDs for symbolic model checking in CCS. Distrib Comput 6, 155–164 (1993). https://doi.org/10.1007/BF02242704
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02242704