Rewriting semantics of production rule sets

Michael Katelman, Sean Keller, José Meseguer
2012 The Journal of Logic and Algebraic Programming  
This paper is about the semantics of production rule sets, a language used to model asynchronous digital circuits. Two formal semantics are developed and proved equivalent: a settheoretic semantics that improves upon an earlier effort of ours, and an executable semantics in rewriting logic. The set-theoretic semantics is especially suited to meta-level proofs about production rule sets, whereas the executable semantics can be used with existing tools to establish, automatically, desirable
more » ... ties of individual circuits. Experiments involving several small circuits are detailed wherein the executable semantics and the rewriting logic tool Maude are used to automatically check two important properties: hazard and deadlock freedom. In doing so, we derive several useful optimizations that make automatic checking of these properties more tractable. (J. Meseguer). 1 It should be noted for readers familiar with asynchronous circuit design that the semantics developed captures a particular timing assumption, specifically delay-insensitivity. Section 7 briefly addresses two more sophisticated timing assumptions, namely speed-independence and quasi-delay-insensitivity.
doi:10.1016/j.jlap.2012.06.002 fatcat:ky27slxbqvctbn4fcz3kb4f7di