Abstract
In [11], 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 grows without bound. This would seem to preclude its application to families ofN 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.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Y. Afek, D. S. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. InProceedings of 11th ACM Symp. on Principles of Distributed Computing, 1992.
M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. InProceedings of 5th ACM Symp. on Principles of Distributed Computing, 1986.
D. Dill.Trace Theory for Automatic Hierarchical Verification. MIT Press, 1989.
S. M. German and A. P. Sistla. Reasoning about systems with many processes.JACM, 39:675–735, 1992.
Z. Har'El and R. P. Kurshan. Modelling concurrent processes. InProceedings of Internat. Conf. Syst. Sci. Eng., pages 382–385, 1988.
M. Hennessy.Algebraic Theory of Processes. MIT Press, 1988.
C. A. R. Hoare.Communicating Sequential Processes. Prentice-Hall, 1985.
R. P. Kurshan. Analysis of discrete event coordination.LNCS, 430:414–453, 1990.
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. InProceedings of CA (LNCS 697), pages 166–179, 1993.
R. P. Kurshan and K. McMillan. A structural induction theorem for processes. InProceedings of 8th ACM Symp. on Principles of Distributed Computing, pages 239–247, 1989.
R. P. Kurshan, M. Merritt, A. Orda, and S. R. Sachs. Formal verification of a distributed algorithm for accessing faulty shared memory. InProceedings of SBT/IEEE International Telecommunications Symposium, 1994.
N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. InProceedings of 6th ACM Symp. on Principles of Distributed Computing, pages 137–151, 1987.
R. Milner. A calculus for communicating systems.LNCS, 92, 1980.
Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification.LNCS, 407:151–165, 1989.
Author information
Authors and Affiliations
Additional information
A previous version of this paper appears in the Proceedings of CAV 1993 (LNCS 697).
Rights and permissions
About this article
Cite this article
Kurshan, R.P., Merritt, M., Orda, A. et al. A structural linearization principle for processes. Form Method Syst Des 5, 227–244 (1994). https://doi.org/10.1007/BF01383832
Issue Date:
DOI: https://doi.org/10.1007/BF01383832