Submitted Papers

Application and Theory of Petri Nets 1992

Volume 616 of the series Lecture Notes in Computer Science pp 205-223


Formal verification of an arbiter cascade

  • Hartmann J. GenrichAffiliated withGesellschaft für Mathematik und Datenverarbeitung
  • , Robert M. ShapiroAffiliated withMeta Software Corporation

* Final gross prices may vary according to local VAT.

Get Access


The asynchronous access of a group of users (e.g. processors) to a single resource (e.g. bus) is regulated by a cascade of arbiters. A single arbiter circuit handles two users. The cascade permits any number of users to be serviced. We use a hierarchical Colored Petri Net to describe the arbiter circuit and the protocol for using it. We also describe the layout of a 2d input cascade of (2d-1) arbiters, d≥1 being the depth of the cascade. We verify the proper functioning of the cascade, first for depth d=1 using an occurrence graph analyzer to prove crucial invariants and confonmance to the protocol; then for arbitrary depth using mathematical induction. As an alternative proof, we develop equivalent Petri net substitutes for the building blocks of the design and verify the resultant special net using classical net theoretic methods. Based on the verification we propose a change of the arbiter to speed-up the cascade.