Decomposition in Asynchronous Circuit Design

Authors:
Walter Vogler;Ralf Wollowski
Affiliations:
-;-
Venue:
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Year:
2002

Citing 7
Cited 0

Transformations and decompositions of nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Trace theory for automatic hierarchical verification of speed-independent circuits

Trace theory for automatic hierarchical verification of speed-independent circuits
Arbiters: an exercise in specifying and decomposing asynchronously communicating components

Science of Computer Programming
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required Behavior

Proceedings of the IFIP WG10.2/WG10.5 Workshops on Synthesis for Control Dominated Circuits
Structural Transformations Giving B-Equivalent PT-Nets

Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
OR Causality: Modelling and Hardware Implementation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
CASCADE: a tool kernel supporting a comprehensive design method for asynchronous controllers

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements. We present a decomposition algorithm and formally prove it correct, where an interesting aspect is the use of a bisimulation with angelic nondeterminism. In contrast to similar approaches in the literature, our algorithm is very generally applicable.