@inproceedings{7c2112b773ad4da4aa460fb69d0a5975,

title = "Convergence of iteration systems",

abstract = "An iteration system is a set of assignment statements whose computation proceeds in steps: at each step, an arbitrary subset of the statements is executed in parallel. The set of statements thus executed may differ at each step; however, it is required that each statement is executed infinitely often along the computation. The convergence of such systems (to a fixed point) is typically verified by showing that the value of a given variant function is decreased by each step that causes a state change. Such a proof requires an exponential number of cases (in the number of assignment statements) to be considered. In this paper, we present alternative methods for verifying the convergence of iteration systems. In most of these methods, upto a linear number of cases need to be considered.",

author = "Anish Arora and Paul Attie and Michael Evangelist and Mohamed Gouda",

year = "1990",

month = jan,

day = "1",

doi = "10.1007/BFb0039052",

language = "English (US)",

isbn = "9783540530480",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "70--82",

editor = "J.W. Klop and J.C.M. Baeten and J.W. Klop and J.C.M. Baeten",

booktitle = "CONCUR 1990 - Theories of Concurrency",

note = "Conference on Theories of Concurrency, CONCUR 1990 ; Conference date: 27-08-1990 Through 30-08-1990",

}