Abstract
In [1], an induction principle for processes was given which allows one to apply model-checking techniques to parameterized families of processes. A limitation of the induction principle is that it does not apply to the case in which one process depends directly upon a parameterized number of processes, which number grows without bound. This would seem to preclude its application to families of N processes interconnected in a star topology. Nonetheless, we show that if the dependency can be computed incrementally, then the direct dependency upon the parameterized number of processes may be re-expressed recursively in terms of a linear cascade of processes, yielding in effect a “linearization” of the inter-process dependencies and allowing the induction principle to apply.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. P. Kurshan and K. McMillan, “A structural induction theorem for processes,” in Proceedings of 8th ACM Symp. on Principles of Distributed Computing, pp. 239–247, 1989.
Z. Har'El and R. P. Kurshan, “Modelling concurrent processes,” in Proceedings of Internat. Conf. Syst. Sci. Eng., pp. 382–385, 1988.
M. C. Browne, E. M. Clarke, and O. Grumberg, “Reasoning about networks with many identical finite state processes,” in In ACM Symp. Principles of Distributed Computing 5, 1986.
S. M. German and A. P. Sistla, “Reasoning about systems with many processes,” GTE Laboratories Inc., Waltham, Massachusetts, 1988.
Z. Shtadler and O. Grumberg, “Network grammars, communication behaviors and automatic verification,” LNCS, vol. 407, pp. 151–165, 1989.
Y. Afek, D. S. Greenberg, M. Merritt, and G. Taubenfeld, “Computing with faulty shared memory,” in Proceedings of 11th ACM Symp. on Principles of Distributed Computing, 1992.
R. P. Kurshan, M. Merritt, A. Orda, and S. R. Sachs, “Formal verification of a distributed algorithm for accessing faulty shared memory,” (in preparation), 1993.
R. P. Kurshan, “Analysis of discrete event coordination,” LNCS, vol. 430, pp. 414–453, 1990.
D. Dill, Trace Theory for Automatic Hierarchical Verification. MIT Press, 1989.
M. Hennessy, Algebraic Tehory of Processes. MIT Press, 1988.
R. Milner, A Calculus for Communicating Systems (volume 92 of LNCS). Springer-Verlag, 1980.
N. Lynch and M. Tuttle, “Hierarchical correctness proofs for distributed algorithms,” in Proceedings of 6th ACM Symp. on Principles of Distributed Computing, pp. 137–151, 1987.
C. A. R. Hoare, Communicating Sequential Processes. Prentice-Hall, 1985.
R. P. Kurshan, Automata-Theoretic Verification of Coordinating Processes. UC Berkeley Lecture Notes, 1992.
R. P. Kurshan and L. Lamport, “Verification of a multiplier: 64 bits and beyond,” preprint, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurshan, R.P., Merritt, M., Orda, A., Sachs, S.R. (1993). A Structural linearization principle for processes. In: Courcoubetis, C. (eds) Computer Aided Verification. CAV 1993. Lecture Notes in Computer Science, vol 697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56922-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-56922-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56922-0
Online ISBN: 978-3-540-47787-7
eBook Packages: Springer Book Archive