Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the models for asynchronous circuit behaviour with OR causality

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

Abstract

Asynchronous circuits behave like concurrent programs implemented in hardware logic. The processes in such circuits are synchronised in accordance with the dynamic logical and causal conditions between switching events. The classical paradigm, easily represented in most process-oriented languages for concurrent systems modelling, is AND causality, which is often associated with a rendez-vous synchronisation. In this paper we investigate a different, less known paradigm, called OR causality. This paradigm is however different from the classical MERGE paradigm, which is based on mutually exclusive events. Petri nets and Change Diagrams provide adequate modelling and circuit synthesis tools for the various OR causality types, yet they do not always bring the specifier to a unique decision about which modelling construct must be used for which type. We present a unified descriptive tool, called Causal Logic Net, which is graphically based on Petri net but has an explicit logic causality annotation for transitions. It is aimed as the least possible generalisation of Petri nets and Change Diagrams. The signal-transition interpretation of this tool is analogous to, but more powerful than, the well-known Signal Transition Graph. A number of examples demonstrate the usefulness of this model in the synthesis of asynchronous control circuits. It is shown that the extension of the basic, unconditional, firing rule with the one that depends upon the marking of the transition preconditions increases the descriptive power of the model to that of the Turing Machine model and allows the modelling of non-commutative state transition behaviour in a purely causal form.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. K. van Berkel, “Handshake circuits: an intermediary between communicating processes and VLSI,” PhD thesis, Technical University of Eindhoven, 1992.

  2. G. Berry. “Stable models of typed lambda-calculi”, in Proc. ICALP '78, pages 72–89, Berlin, 1978, Springer-Verlag. Lecture Notes in Computer Science 62.

    Google Scholar 

  3. T.-A. Chu ”On the models for designing VLSI asynchronous digital systems”, Integration: the VLSI journal, vol. 4, pp. 99–113, 1986.

    Google Scholar 

  4. T.-A. Chu, “Automatic synthesis and verification of hazard-free control circuits from asynchronous finite state machine specifications,” in Proceedings of ICCD'92, Cambridge, MA, October 1992.

  5. T.A. Chu, “Synthesis of Self-Timed VLSI Circuits from Graph-theoretic Specifications,” PhD thesis, MIT, 1987.

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

    Google Scholar 

  7. J.C. Ebergen, “Translating Programs into Delay-Insensitive Circuits”, vol. 56 of CWI Tract. CWI, Amsterdam, 1989

    Google Scholar 

  8. J. Gunawardena, “Causal automata”, Theoretical Computer Science, vol. 101, no. 2, pp. 265–288, 1992.

    Google Scholar 

  9. M. Hack, “Petri Net Languages,” Technical report, CSG Memo 124, Project MAC, MIT, June 1975.

  10. H. Hulgaard and S. Burns, “Bounded delay model timing analysis of a class of CSP programs with choice”, in Proc. Int. Symp. on Adv. Res. in Asynch. Cir. and Syst., Nov. 1994, pp. 2–11, Los Alamitos, CA, 1994. IEEE Comp. Soc. Press.

    Google Scholar 

  11. M. Josephs and J.T. Udding, “Delay-insensitive circuits,” in Lecture Notes in Computer Science, Vol. 458. Springer-Verlag, 1990.

  12. M.B. Josephs and J. Yantchev, “Low latency asynchronous arbiter: Patent application 9308161.0,” Technical report, Oxford University Computing Laboratory, 1993.

  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. Kishinevsky, “Analysis and implementation of speed-independent circuits,” PhD thesis, Leningrad Electrical Engineering Institute, 1982. (in Russian).

  15. M. Kishinevsky, A. Kondratyev, A. Taubin, and V. Varshavsky, Concurrent Hardware: The Theory and Practice of Self-Timed Design, John Wiley and Sons, London, 1993.

    Google Scholar 

  16. M.A. Kishinevsky, A.Y. Kondratyev, and A.R. Taubin, “Formal method for self-timed design,” in Proc. EDAC'91, pp. 197–201, 1991.

  17. A. Kondratyev and A. Taubin, “Verification of the speed-independent circuits by STG unfolding,” Technical report 94-2-001, The University of Aizu, 1994.

  18. L. Lavagno and A. Sangiovanni-Vincentelli, Algorithms for Synthesis and Testing of Asynchronous Circuits. Kluwer Academic Publishers, Boston, 1993.

    Google Scholar 

  19. A.J. Martin, “Synthesis of asynchronous VLSI circuits”, in J. Staunstrup (ed.), editor, Formal Methods for VLSI Design, chapter 6. North Holland, Amsterdam, 1990. IFIP WG 10.5 Lecture Notes.

    Google Scholar 

  20. K. McMillan and D.L. Dill, “Algorithms for interface timing verification”, in Proc. Int. Conf. on Computer Design: VLSI in Computers (ICCD'92), Oct. 1992, pp. 48–51, Los Alamitos, CA, 1992. IEEE Comp. Soc. Press.

    Google Scholar 

  21. D.G. Messerschmitt, T.H.-Y. Meng, and R.W. Brodersen, “Automatic synthesis of asynchronous circuits from high-level specifications”, IEEE Trans. on CAD, vol. 8, pp. 1185–1205, November 1989.

    Google Scholar 

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

  23. T. Murata, “Petri nets: Properties, analysis and applications”, Proceedings of IEEE, vol. 77, no. 4, pp. 541–580, April 1989.

    Google Scholar 

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

    Google Scholar 

  25. S.M. Nowick and D.L. Dill, “Automatic synthesis of locally-clocked asynchronous state machines,” in Proceedings of ICCAD'91, Santa Clara, CA, November 1991.

  26. P. Panangaden, V. Shanbhogue, and E.W. Stark, “Stability and sequentiality in dataflow networks”, in Proc. ICALP'90, pp. 308–321, Berlin, 1990. Springer-Verlag. Lecture Notes in Computer Science 443.

    Google Scholar 

  27. P. Panangaden and E.W. Stark, “Computations, residuals, and the power of indeterminacy”, in Proc. ICALP'88, pp. 439–454, Berlin, 1988. Springer-Verlag. Lecture Notes in Computer Science 317.

    Google Scholar 

  28. J.L. Peterson, Petri Net Theory and Modeling of Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981.

    Google Scholar 

  29. G. Plotkin, “LCF considered a programming language” Theoretical Computer Science, vol. 5, no. 3, pp. 223–256, 1977.

    Google Scholar 

  30. V.R. Pratt, “Modelling concurrency with partial orders,” International Journal of Parallel Programming, vol. 15, no. 1, 1986.

  31. D.A. Pucknell, “Event-driven logic (edl) approach to digital systems representation and related design processes”, IEE Proceedings-E vol. 140, no. 2, pp. 119–126, 1993.

    Google Scholar 

  32. L. Ya. Rosenblum and A.V. Yakovlev, “Signal graphs: from self-timed to timed ones,” in Proceedings of International Workshop on Timed Petri Nets, Torino, Italy, July 1985, pp. 199–207. IEEE Computer Society, 1985.

  33. C. L. Seitz, System timing. In: Mead, C.A. and L.A. Conway, Introduction to VLSI Systems, pp. 218–262. Addison-Wesley, 1980.

  34. C.L. Seitz, “Ideas about arbiters”, Lambda, vol. 1, no. 1, pp. 10–14, 1980.

    Google Scholar 

  35. E.M. Sentovich, K.J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, R.K. Brayton H. Savoj, P.R. Stephan, and A. Sangiovanni-Vincentelli, “SIS: A system for sequential circuit synthesis”, Technical Report UCB/ERL m92/41, University of California at Berkeley, 1992.

  36. I.E. Sutherland, “Micropipelines”, Communications of ACM. vol. 32, no. 6, pp. 720–738, 1989.

    Google Scholar 

  37. P. Vanbekbergen et al., “Optimized synthesis of asynchronous control circuits from graph-theoretic specifications”, in Proceedings of Int. Conf. on CAD (ICCAD'90), pp. 184–187, November 1990.

  38. V. Varshavsky, M. Kishinevsky, V. Marakhovsky, V. Peschansky, L. Rosenblum, A. Taubin, and B. Tzirlin, Self-Timed Control of Concurrent Processes. Kluwer AP, Dordrecht, 1990.

    Google Scholar 

  39. V.I. Varshavsky, M.A. Kishinevsky, A.Y. Kondratyev, L.Y. Rosenblyum, and A.R. Taubin, “Models for specification and analysis of processes in asynchronous circuits”, Soviet Journal of Computer and System Sciences, vol. 26, no. 2, pp. 61–76, 1989. Russian Edition-1988.

    Google Scholar 

  40. A. Yakovlev, L. Lavagno, and A. Sangiovanni-Vincentelli, “A unified STG model for asynchronous control circuit synthesis,” in Proceedings of ICCAD'92, Santa Clara, CA, November 1992.

  41. A. Yakovlev and A. Petrov, “Petri nets and parallel bus controller design”, in Proc. 11th Int. Conf. on Applications and Theory of Petri Nets. Paris, June 1990, pp. 244–264, 1990.

  42. A. Yakovlev, A. Petrov, and L. Lavagno, “High speed asynchronous arbiter”, IEEE Trans. on VLSI Systems, vol. 2, no. 3, pp. 372–377, September 1994.

    Google Scholar 

  43. A.V. Yakovlev, “On limitations and extensions of STG model for designing asynchronous control circuits”. in Proceedings of ICCD'92, Cambridge, MA, October 1992.

  44. J. Yantchev and I. Nedelchev, “Implementation of a packet switching device as a delay-insensitive circuit,” in Proceedings of the Symposium of Integrated Circuits, 1993.

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Newcastle upon Tyne, NE1 7RU, England

    Alexandre Yakovlev

  2. Department of Computer Hardware, The University of aizu, 965-80, Aizu-Wakamatsu, Japan

    Michael Kishinevsky & Alex Kondratyev

  3. Dipartimento di Elettronica, Politecnico di Torino, 10129, Torino, Italy

    Luciano Lavagno

  4. Department of Computing Science, University of Newcastle upon Tyne, NE1 7RU, England

    Marta Pietkiewicz-Koutny

Authors
  1. Alexandre Yakovlev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kishinevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alex Kondratyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luciano Lavagno
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marta Pietkiewicz-Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yakovlev, A., Kishinevsky, M., Kondratyev, A. et al. On the models for asynchronous circuit behaviour with OR causality. Form Method Syst Des 9, 189–233 (1996). https://doi.org/10.1007/BF00122082

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation