Abstract
FIFO systems consisting of several components that communicate via unbounded perfect FIFO channels arise naturally in modeling distributed systems. Despite well-known difficulties in analyzing such systems, they are of significant interest as they can describe a wide range of Internet-based communication protocols. Previous work has shown that the piecewise languages play important roles in the study of FIFO systems. In this paper, we show that FIFO systems composed of piecewise components can in fact be analyzed algorithmically. We demonstrate that any FIFO system composed of piecewise components can be described by a finite state, abridged structure, representing an expressive abstraction of the system. We present a procedure for building the abridged model and prove that this procedure terminates. We show that we can analyze the infinite computations of the more concrete model by analyzing the computations of the finite, abridged model. This enables us to check properties of the FIFO systems including safety properties of the components as well as a general class of end-to-end system properties. Finally, we apply our analysis method to an IP-telecommunication architecture to demonstrate the utility of our approach.
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
Abdulla, P.A., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 208–222. Springer, Heidelberg (1999)
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: Proc. of LICS 1993, pp. 160–170 (1993)
Argon, P., Delzanno, G., Mukhopadhyay, S., Podelski, A.: Model checking for communication protocols. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, p. 160. Springer, Heidelberg (2001)
Boigelot, B.: Symbolic method for exploring infinite states spaces. PhD thesis, Université de Liège (1998)
Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. FMSD 14(3), 237–255 (1999)
Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172–186. Springer, Heidelberg (1997)
Bond, G.W., Ivančić, F., Klarlund, N., Trefler, R.: Eclipse feature logic analysis. In: Second IP Telephony Workshop (2001)
Bouajjani, A., Jonsson, B., Nillson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
Bouajjani, A., Muscholl, A., Touili, T.: Permutation rewriting and algorithmic verification. In: Proc. of LICS 2001 (2001)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of Int. Cong. on Logic, Methodology, and Philosophy of Science (1960)
Cece, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Information and Computation 124(1), 20–31 (1996)
Finkel, A., Iyer, S.P., Sutre, G.: Well-abstracted transition systems: Application to FIFO automata. Information and Computation 181(1), 1–31 (2003)
Finkel, A., Rosier, L.: A survey on the decidability questions for classes of FIFO nets. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol. 340, pp. 106–132. Springer, Heidelberg (1988)
Jackson, M., Zave, P.: Distributed Feature Composition: A virtual architecture for telecommunications services. IEEE Trans. on Soft. Eng. 24(10), 831–847 (1998)
Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. Theo. Comp. Sci. 256(1–2), 93–112 (2001)
Klarlund, N., Trefler, R.: Regularity results for fifo channels. In: Proc. of AVoCS 2004 (2004) To appear in Electronic Notes in Theoretical Computer Science
Nivat, M., Perrin, D.: Automata on Infinite Words. Springer, Heidelberg (1985)
Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. of PSTV, pp. 207–219 (1987)
Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of language theory., vol. I. Springer, Heidelberg (1997)
Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems 30, 1–39 (1997)
Pnueli, A.: The temporal logic of programs. In: Proc. 18th FOCS, pp. 46–57 (1977)
Simon, I.: Piecewise testable events. Proc. of 2nd GI Conf. 33, 214–222 (1975)
Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. of LICS 1986, pp. 332–344 (1986)
Zave, P., Jackson, M.: DFC Manual. AT&T (2001) Updated as needed. Available from, http://www.research.att.com/projects/dfc
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghafari, N., Trefler, R. (2005). Piecewise FIFO Channels Are Analyzable. In: Emerson, E.A., Namjoshi, K.S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2006. Lecture Notes in Computer Science, vol 3855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11609773_17
Download citation
DOI: https://doi.org/10.1007/11609773_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31139-3
Online ISBN: 978-3-540-31622-0
eBook Packages: Computer ScienceComputer Science (R0)