Convergence of iteration systems

Anish Arora, Paul Attie, Michael Evangelist, Mohamed Gouda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationCONCUR 1990 - Theories of Concurrency
Subtitle of host publicationUnification and Extension, Proceedings
EditorsJ.W. Klop, J.C.M. Baeten, J.W. Klop, J.C.M. Baeten
PublisherSpringer Verlag
Pages70-82
Number of pages13
ISBN (Print)9783540530480
DOIs
StatePublished - Jan 1 1990
Externally publishedYes
EventConference on Theories of Concurrency, CONCUR 1990 - Amsterdam, Netherlands
Duration: Aug 27 1990Aug 30 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume458 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceConference on Theories of Concurrency, CONCUR 1990
CountryNetherlands
CityAmsterdam
Period8/27/908/30/90

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Convergence of iteration systems'. Together they form a unique fingerprint.

Cite this