Abstract
Rewrite systems over words are often used for modeling distributed algorithms over linear networks (or rings) of N processes, where N is a parameter. Here we are interested in constructing a regular set of configurations \( \mathcal{G} \) which is unavoidable, i.e., such that any infinite derivation intersects \( \mathcal{G} \). We give some sufficient conditions of the rewrite system that allow us to construct an unavoidable set \( \mathcal{G} \) using Caucal’s algorithm of prefix rewriting. This construction is used to show the convergence property of distributed algorithms to closed subsets of configurations. The method is useful for proving the correctness of self-stabilizing algorithms and the liveness property of termination detection algorithms. It has been implemented, and successfully applied to several significant examples, treated in a uniform mechanical way for the first time.
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.
Similar content being viewed by others
References
P.A. Abdulla, A. Bouajjani, B. Jonsson and M. Nilsson. “Handling global conditions in parameterized system verification”. Proc. CAV’99, LNCS 1633, Springer-Verlag, 1999, pp. 134–145.
K.R. Apt and D.C. Kozen. “Limits for automatic verification of finite-state concurrent systems”. Information Processing Letters 22, 1986, pp. 307–309.
J. Beauquier, B. Bérard, L. Fribourg and F. Magniette. “Proving convergence of self-stabilizing systems using first-order rewriting and regular languages”. Distributed Computing 14:2, 2001, pp. 83–95.
J. Beauquier and O. Debas. “An optimal self-stabilizing algorithm for mutual exclusion on uniform bidirectional rings”. Proc. 2nd Workshop on S elf-Stabilizing Systems, Las Vegas, 1995, pp. 226–239.
R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, 1993.
A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems and P. Wolper. “An Efficient Automata Approach to Some Problems on Context-Free Grammars”. Information Processing Letters 74(5–6), 2000, pp. 221–227.
A. Bouajjani, B. Jonsson, M. Nilsson and T. Touili. “Regular Model-Checking”. Proc. CAV’00, LNCS 1855, Springer-Verlag, 2000, pp. 403–418.
D. Caucal. “On the regular structures of prefix rewriting”. Proc CAAP’90, Copenhagen, 1990, LNCS 431, Springer, pp. 87–102.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison and M. Tommasi. Tree Automata Techniques and Applications. Available on http://www.grappa.univ-lille3.fr/tata/.
N. Dershowitz. “Termination of Linear Rewriting Systems”. Proc. ICALP, LNCS 115, Springer-Verlag, 1981, pp. 448–458.
N. Dershowitz and J.-P. Jouannaud. “Rewrite Systems”. Handbook of Theoretical Computer Science, vol. B, Elsevier-MIT Press, 1990, pp. 243–320.
E.W. Dijkstra. “Self-stabilizing systems in spite of distributed control”. Comm. ACM 17:11, 1974, pp. 643–644.
E.W. Dijkstra, W.H.J Feijen and A.J.M. van Gasteren. “Derivation of a Termination Detection Algorithm for Distributed Computations”. Information Processing Letters, vol. 16, 1983, pp. 217–219.
S. Dolev. Self-Stabilization. MIT-Press, 2000.
M. Duflot, L. Fribourg and U. Nilsson. Unavoidable Configurations of Parameterized Rings of Processes. Research Report LSV-00-10, ENS de Cachan, Nov. 2000. (Available on http://www.lsv.ens-cachan.fr/fribourg/publis.html)
L. Fribourg and H. Olsén. “Reachability sets of parametrized rings as regular languages”. Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY’97), volume 9 of Electronical Notes in Theoretical Computer Science. Elsevier Science, 1997.
S. Ghosh. “An Alternative Solution to a Problem on Self-Stabilization”. ACM TOPLAS 15:4, 1993, pp. 735–742.
J.-H. Hoepman. “Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings”. Proc. 8th Workshop on Distributed Algorithms, LNCS 857, Springer-Verlag. 1994, pp. 265–279.
B. Jonsson and M. Nilsson. “Transitive closures of regular relations for verifying infinite-state systems”. Proc. TACAS’00, LNCS 1785, Springer-Verlag, 2000.
Y. Kesten, O. Maler, M. Marcuse, A. Pnueli and E. Shahar. “Symbolic Model-Checking with Rich Assertional Languages”. Proc. CAV’97, LNCS 1254, Springer-Verlag, 1997, pp. 424–435.
O. Kupferman and M.Y. Vardi. “An Automata-Theoretic Approach to Reasoning about Infinite-State Systems”. Proc. CAV’00, LNCS 1855, Springer-Verlag, 2000.
D. Lesens, N. Halbwachs and P. Raymond. “Automatic Verification of Parametrized Linear Network of Processes”. Proc. POPL’97, Paris, 1997.
G. van Noord. Fsa Utilities User Manual Version 5, 1998.
A. Pnueli and E. Shahar. “Liveness and Acceleration in Parameterized Verification”. Proc. CAV’00, LNCS 1855, Springer-Verlag, 2000, pp. 328–343.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
P. Wolper and B. Boigelot. “Verifying systems with infinite but regular state spaces”. Proc. CAV’98, LNCS 1427, Springer-Verlag, 1998, pp. 88–97.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duflot, M., Fribourg, L., Nilsson, U. (2001). Unavoidable Configurations of Parameterized Rings of Processes. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive