Skip to main content
Log in

A unified signal transition graph model for asynchronous control circuit synthesis

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Characterization of the behavior of an asynchronous system depending on the delay of components and wires is a major task facing designers. Some of these delays are outside the designer's control, and in practice may have to be assumed unbounded. The existing literature offers a number of analysis and specification models, but lacks a unified framework to verify directly if the circuit specification admits a correct implementation under these hypotheses.

Our aim is to fill exactly this gap, offering both low-level (analysis-oriented) and high-level (specification-oriented) models for asynchronous circuits and the environment where they operate, together with strong equivalence results between the properties at the two levels. One interesting side result is the precise characterization of classical static and dynamic hazards in terms of our model. Consequently the designer can check the specification and directly decide if the behavior of any implementation will depend, e.g., on the delays of the signals described by such specification.

We also outline a design methodology based on our models, pointing out how they can be used to select appropriate high and low-level models depending on the desired characteristics of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P.A. Beerel and T.H.-Y. Meng, “Gate-level synthesis of speed-independent asynchronous control circuits”, in Proceedings of the ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (TAU), March 1992.

  2. E. Best, “Structural theory of Petri nets: The free-choice hiatus”, Lecture Notes in Computer Science, Vol. 254, pp. 168–206, 1987.

    Google Scholar 

  3. E. Best and K. Voss, “Free choice systems have home states”, Acta Informatica, Vol. 21, pp. 89–100, 1984.

    Google Scholar 

  4. J.A. Brzozowski and C.-J. Seger, “Advances in asynchronous circuit theory-Part I: Gate and unbounded inertial delay models”, Bulletin of the European Association of Theoretical Computer Science, Oct. 1990.

  5. S. Burns and A. Martin, “A synthesis method for self-timed VLSI circuits”, in Proceedings of the International Conference on Computer Design, 1987.

  6. T.-A. Chu, “Synthesis of self-timed control circuits from graphs: An example”, in Proceedings of the International Conference on Computer Design, pp. 565–571, 1986.

  7. T.-A. Chu, “Synthesis of Self-timed VLSI Circuits from Graph-theoretic Specifications”, Ph.D. thesis, MIT, June 1987.

  8. F. Commoner, A.W. Holt, S. Even, and A. Pnueli, “Marked directed graphs”, Journal of Computer and System Sciences, Vol. 5, pp. 511–523, 1971.

    Google Scholar 

  9. D.L. Dill, Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits, The MIT Press, Cambridge, Mass., 1988, An ACM Distinguished Dissertation 1988.

    Google Scholar 

  10. J. Gunawardena, “Causal automata”, Theoretical Computer Science, Vol. 101, No. 2, pp. 265–288, 1992.

    Google Scholar 

  11. J. Gunawardena, “On the causal structure of the Muller unfolding”, Technical Report STAN-CS-93-1466, Dept. of Comp. Sci., Stanford University, March 1993.

  12. D.A. Huffman, “The synthesis of sequential switching circuits”, J. Franklin Institute, Vol. 257, pp. 161–190, 275–303, March 1954.

    Google Scholar 

  13. R.M. Keller, “A fundamental theorem of asynchronous parallel computation”, Lecture Notes in Computer Science, Vol. 24, pp. 103–112, 1975.

    Google Scholar 

  14. M.A. Kishinevsky, A.Y. Kondratyev, and A.R. Taubin, “Formal method for self-timed design”, in Proceedings of the European Design Automation Conference (EDAC), 1991.

  15. M.A. Kishinevsky, A.Y. Kondratyev, A.R. Taubin, and V.I. Varshavsky, “Analysis and identification of self-timed circuits”, in Proceedings of IFIP 2nd Workshop on Designing Correct Circuits, pp. 275–287, Jan. 1992.

  16. M.A. Kishinevsky, A.Y. Kondratyev, A.R. Taubin, and V.I. Varshavsky, “On self-timed behavior verification”, in Proceedings of the ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (TAU), 1992.

  17. M.A. Kishinevsky, A.Y. Kondratyev, A.R. Taubin, and V.I. Varshavsky, Concurrent Hardware. The Theory and Practice of Self-Timed Design, John Wiley and Sons Ltd., 1993.

  18. L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Algorithms for synthesis of hazard-free asynchronous circuits”, in Proceedings of the Design Automation Conference, June 1991.

  19. L. Lavagno, C.W. Moon, R.K. Brayton, and A. Sangiovanni-Vincentelli, “Solving the state assignment problem for signal transition graphs”, in Proceedings of the Design Automation Conference, June 1992.

  20. A. Martin, “Programming in VLSI: From communicating processes to delay-insensitive circuits”, in C.A.R. Hoare (Ed.), Developments in Concurrency and Communications, The UT Year of Programming Series, Addison-Wesley, 1990.

  21. A. Martin, “Synthesis of asynchronous VLSI circuits”, in J. Staunstrup (Ed.), Formal Methods for VLSI Design, North-Holland, 1990.

  22. R.E. Miller, Switching Theory, Wiley and Sons, Vol. 2, Chapter 10, pp. 192–244, 1965.

  23. C.W. Moon, P.R. Stephan, and R.K. Brayton, “Synthesis of hazard-free asynchronous circuits from graphical specifications”, in Proceedings of the International Conference on Computer-Aided Design, Nov. 1991.

  24. D.E. Muller and W.C. Bartky, “A theory of asynchronous circuits”, in Annals of Computing Laboratory of Harvard University, pp. 204–243, 1959.

  25. T. Murata, “Petri nets: Properties, analysis and applications”, Proceedings of the IEEE, pp. 541–580, April 1989.

  26. M. Nielsen, G. Plotkin, and G. Winskel, “Petri nets, event structures and domains. Part I”, Theoretical Computer Science, Vol. 13, pp. 85–108, 1981.

  27. J.L. Peterson, “Petri nets”, ACM Computing Surveys, Vol. 9, No. 3, Sept. 1977.

  28. C.A. Petri, “Kommunikation mit Automaten”, Ph.D. thesis, Bonn, Institut für Instrumentelle Mathematik, 1962, (Technical report Schriften des IIM Nr. 3).

  29. L.Y. Rosenblum and A.V. Yakovlev, “Signal graphs:From self-timed to timed ones”, in International Workshop on Timed Petri Nets, Torino, Italy, 1985.

  30. C.L. Seitz, “Asynchronous machines exhibiting concurrency”, in Proceedings of the Project MAC Conference on Concurrent Systems and Parallel Computation, 1970.

  31. C.L. Seitz, “Ideas about arbiters”, Lambda, Vol. 1, (1, First Quarter), pp. 10–14, 1980.

    Google Scholar 

  32. C.L. Seitz, Chapter 7, in C. Mead and L. Conway (Eds.), Introduction to VLSI Systems, Addison Wesley, 1981.

  33. J.T. Udding, “A formal model for defining and classifying delay-insensitive circuits and systems”, Distributed Computing, Vol. 1, pp. 197–204, 1986.

    Google Scholar 

  34. S.H. Unger, Asynchronous Sequential Switching Circuits, Wiley Interscience, 1969.

  35. J.L.A.van de Snepscheut, “Trace Theory and VLSI Design”, Vol. 200 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1985.

    Google Scholar 

  36. P. Vanbekbergen, G. Goossens, and H. De Man, “A local optimization technique for asynchronous control circuits”, in Proceedings of the International Workshop on Logic Synthesis, May 1991.

  37. P. Vanbekbergen, B. Lin, G. Goossens, and H. De Man, “A generalized state assignment theory for transformations on Signal Transition Graphs”, in Proceedings of the International Conference on Computer-Aided Design, pp. 112–117, Nov. 1992.

  38. V.I. Varshavsky, M.A. Kishinevsky, A.Y. Kondratyev, L.Y. Rosenblum, and A.R. Taubin, “Models for specification and analysis of processes in asynchronous circuits”, Izvestiia Akademii nauk SSSR, Tekhnicheskaya Kibernetika, pp. 171–190, 1988, English translation: Soviet Journal of Computer and Systems Sciences.

  39. V.I. Varshavsky, M.A. Kishinevsky, V.B. Marakhovsky, V.A. Peschansky, L.Y. Rosenblum, A.R. Taubin, and B.S. Tzirlin, Self-timed Control of Concurrent Processes, Kluwer Academic Publisher, 1990 (Russian edition: 1986).

  40. A.V. Yakovlev, “Analysing concurrent systems through lattices”, Technical Report CS-91-9, Polytechnic of Wales, 1991.

  41. A.V. Yakovlev, “On limitations and extensions of STG model for designing asynchronous control circuits”, in Proceedings of the International Conference on Computer Design, pp. 396–400, Oct. 1992.

  42. A.V. Yakovlev and A. Petrov, “Petri nets and parallel bus controller design”, in International Conference on Application and Theory of Petri Nets, Paris, France, IEEE Computer Society, June 1990.

  43. A.V. Yakovlev, M. Kishinevsky, A.Y. Kondratyev, and L. Lavagno, “Or causality: Modelling and hardware implementation”, in International Conference on Application and Theory of Petri Nets, Zaragoza, Spain, IEEE Computer Society, June 1994.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yakovlev, A., Lavagno, L. & Sangiovanni-Vincentelli, A. A unified signal transition graph model for asynchronous control circuit synthesis. Form Method Syst Des 9, 139–188 (1996). https://doi.org/10.1007/BF00122081

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00122081

Keywords

Navigation