Calculating a Round-Robin Scheduler

Kropf [7] has collected together a number of problems that can be used as benchmarks for hardware verification, one of which is a bus arbiter. The function of the bus arbiter is to assign the use of a shared resource on each clock cycle to one out of N subsystems that may want to use it, and in such a way that no subsystem is denied access forever. The most significant component in its implementation is a round-robin scheduler. Rather than verify the existing implementation of the scheduler, this paper shows how to construct a correct implementation from the given requirements. We make use of both point-free and pointwise relation algebra.

[1]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[2]  Vaj Tijn Borghuis.  Priorean tense logics in modal pure type systems , 1996 .

[3]  van der Wmp Wil Aalst,et al.  Conservative adaption of workflow , 1996, PAKM.

[4]  Michel A. Reniers,et al.  Static semantics of message sequence charts , 1996 .

[5]  Gjpm Geert-Jan Houben,et al.  Designing effective workflow management processes , 1996 .

[6]  Erik Poll,et al.  Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997). , 1999 .

[7]  A. T. M. Aerts,et al.  OODB Support for WWW Applications: Disclosing the internal structure of Hyperdocuments , 1996, WebNet.

[8]  Twan Basten,et al.  A process-algebraic approach to life-cycle inheritance : inheritance = encapsulation + abstraction , 1996 .

[9]  Mgj Franssen,et al.  Tools for the construction of correct programs : an overview , 1997 .

[10]  Jjm Jozef Hooman,et al.  A programming-language extension for distributed real-time systems , 1997 .

[11]  M. Voorhoeve.  Structural Petri net equivalence , 1996 .

[12]  Atm Ad Aerts,et al.  Multi-user publishing in the Web: DReSS, a Document Repository Service Station , 1996 .

[13]  Fairouz Kamareddine,et al.  A correspondence between Nuprl and the Ramified Theory of Types , 1996 .

[14]  W. W. C. Luk,et al.  Systematic serialisation of array-based architectures , 1993, Integr..

[15]  Roland Carl Backhouse,et al.  A relational theory of datatypes , 1992 .

[16]  Lmg Loe Feijs.  Algebraic specification and simulation of lazy functional programs in a concurrent environment , 1996 .

[17]  Avra Cohn,et al.  Theoretical Foundations of VLSI Design: A mechanized proof of correctness of a simple counter , 1990 .

[18]  Wil M. P. van der Aalst,et al.  Life-Cycle Inheritance: A Petri-Net-Based Approach , 1997, ICATPN.

[19]  W.M.P. van der Aalst,et al.  Parallel computation of reachable dead states in a free-choice Petri net , 1996 .

[20]  Hans Weigand,et al.  A formal specification of deadlines using dynamic deontic logic , 1996 .

[21]  Geraint Jones,et al.  Designing Circuits By Calculation , 1990 .

[22]  F. Rietman,et al.  A relational calculus for the design of distributed algorithms , 1995 .

[23]  W.M.P. van der Aalst,et al.  Structural characterizations of sound workflow nets , 1996 .

[24]  P.D.V. van der Stok,et al.  Real-time distributed concurrency control algorithms with mixed time constraints , 1996 .

[25]  Jcm Jos Baeten,et al.  Discrete-time process algebra with empty process , 1997 .

[26]  R. T. Gerth,et al.  A discretisation method for asynchronous timed systems , 1997 .

[27]  Roland Carl Backhouse,et al.  Deriving a systolic regular language recognizer , 1997, Algorithmic Languages and Calculi.