CaltechAUTHORS
  A Caltech Library Service

Stable Production Rule Sets are Deterministic

Papadantonakis, Karl (2003) Stable Production Rule Sets are Deterministic. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:2003.003

[img]
Preview
Postscript
See Usage Policy.

219Kb
[img]
Preview
PDF
See Usage Policy.

182Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:2003.003

Abstract

Production Rule Sets (PRS) are a digital event-based model for CMOS circuits; stable production rule sets are those in which in every execution, every enabled rule remains enabled until it is executed. It has been conjectured that stable production rule sets are determinstic, meaning in particular that they cannot implement arbiters, and that the sequence of values sent on any channel is independent of the execution. In this paper, we prove these facts rigorously, directly from first principles. We also propose improvements to PRS testing tools based on the resulting theory.


Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Subject Keywords:asynchronous VLSI stability determinism PRS execution arbitration handshaking
Record Number:CaltechCSTR:2003.003
Persistent URL:http://resolver.caltech.edu/CaltechCSTR:2003.003
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:27064
Collection:CaltechCSTR
Deposited By: Imported from CaltechCSTR
Deposited On:02 Jul 2003
Last Modified:26 Dec 2012 14:13

Repository Staff Only: item control page