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.
Partially supported by DFG-project’ sTG-Dekomposition’ Vo615/7-1 / Wo814/1-1.
Usually, the labels in STGs are not signals, but rising and falling edges of signals, which for each signal are required to alternate; this is of minor importance here, so we abstract from this distinction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. André. Structural transformations giving B-equivalent PT-nets. In Pagnoni and Rozenberg, editors, Applications and Theory of Petri Nets, Informatik-Fachber. 66, 14–28. Springer, 1983.
J. Beister, G. Eckstein, and R. Wollowski. Cascade: a tool kernel supporting a comprehensive design method for asynchronous controllers. In M. Nielsen, editor, Applications and Theory of Petri Nets 2000, LNCS 1825, 445–454. Springer, 2000.
J. Beister and R. Wollowski. Controller implementation by communicating asynchronous sequential circuits generated from a Petri net specification of required behaviour. In G. Caucier and J. Trilhe, editors, Synthesis for Control Dominated Circuits, 103–115. Elsevier Sci. Pub. 1993.
G. Berthelot. Transformations and decompositions of nets. In W. Brauer et al., editors, Petri Nets: Central Models and Their Properties, Lect. Notes Comp. Sci. 254, 359–376. Springer, 1987.
T.-A. Chu. Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. PhD thesis, MIT, 1987. Extended abstract in IEEE Int. Conf. Computer Design ICCD’ 87, 1987, p.220–223.
J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Trans. Inform. and Systems, E80-D, 3:315–325, 1997.
D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent circuits. MIT Press, Cambridge, 1988.
J. Ebergen. Arbiters: an exercise in specifying and decomposing asynchronously communicating components. Sci. of Computer Programming, 18:223–245, 1992.
A. Kondratyev, M. Kishinevsky, and A. Taubin. Synthesis method in self-timed design. Decompositional approach. In IEEE Int. Conf. VLSI and CAD, pages 324–327, 1993.
W. Vogler and R. Wollowski. Decomposition in asynchronous circuit design. Technical Report 2002-5, University of Augsburg, http://www.Informatik.Uni-Augsburg.DE/skripts/techreports/, 2002.
A. Yakovlev, M. Kishinevsky, A. Kondratyev, and L. Lavagno. Or causality: Modelling and hardware implementation. In R. Valette, editor, Applications and Theory of Petri Nets 1994, Lect. Notes Comp. Sci. 815, 568–587. Springer, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vogler, W., Wollowski, R. (2002). Decomposition in Asynchronous Circuit Design. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_30
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive