Abstract
Message-passing algorithms (MPAs) are an algorithmic paradigm for the following generic problem: given a system consisting of several interacting components, compute a new version of each component representing its behaviour inside the system. MPAs avoid computing the full state space by propagating messages along the edges of the system interaction graph. We present an MPA for verifying local properties of distributed protocols with a tree communication structure. We report on an implementation, and validate it by means of two case studies, including an analysis of the PGM protocol.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fabre, E.: Bayesian Networks of Dynamic Systems. Habilitation à diriger des recherches, Université de Rennes1 (2007)
Fabre, E., Jezequel, L.: Distributed optimal planning: an approach by weighted automata calculus. In: CDC, pp. 211–216 (2009)
Fabre, E., Jezequel, L., Haslum, P., Thiébaux, S.: Cost-optimal factored planning: Promises and pitfalls. In: ICAPS, pp. 65–72 (2010)
Raymond, K.: A tree-based algorithm for distributed mutual exclusion. TCS 7(1), 61–77 (1989)
Speakman, T., et al.: PGM reliable transport protocol specification. RFC 3208 (Experimental) of the IETF (2001)
Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331–346. Springer, Heidelberg (2003)
Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213–224. Springer, Heidelberg (2003)
Graf, S., Steffen, B.: Compositional minimization of finite state systems. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 186–196. Springer, Heidelberg (1991)
Grumberg, O., Long, D.E.: Model checking and modular verification. TOPLAS 16(3), 843–871 (1994)
Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hullance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 133–152. Springer, Heidelberg (1995)
FRD2 user manual (2009)
Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: A semantics-based tool for the verification of concurrent systems. TOPLAS 15(1), 36–72 (1993)
Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. STTT 15(2), 89–107 (2013)
Abdulla, P.A.: Regular model checking. STTT 14(2), 109–118 (2012)
Bérard, B., Bouyer, P., Petit, A.: Analysing the PGM protocol with UPPAAL. International Journal of Production Research 42(14), 2773–2791 (2004)
Boyer, M., Sighireanu, M.: Synthesis and verification of constraints in the PGM protocol. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 264–281. Springer, Heidelberg (2003)
Esparza, J., Maidl, M.: Simple representative instantiations for multicast protocols. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 128–143. Springer, Heidelberg (2003)
Bodlaender, H.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STC, pp. 226–234 (1993)
Sakarovitch, J.: Éléments de théorie des automates. Vuibert (2003)
Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating processes. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 281–305. Springer, Heidelberg (1985)
Valmari, A.: All linear-time congruences for finite LTSs and familiar operators. In: ACSD (2012)
Holzmann, G.: The SPIN model checker: primer and reference manual. Addison-Wesley Professional (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jezequel, L., Esparza, J. (2014). Message-Passing Algorithms for the Verification of Distributed Protocols. In: McMillan, K.L., Rival, X. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2014. Lecture Notes in Computer Science, vol 8318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54013-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-54013-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54012-7
Online ISBN: 978-3-642-54013-4
eBook Packages: Computer ScienceComputer Science (R0)