Hardware and Petri Nets Application to Asynchronous Circuit Design

1. E. Badouel and Ph. Darondeau. Theory of regions. In G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science [36], pages 529–586. Springer-Verlag, 1998.

   Chapter  Google Scholar 

2. P. Beerel and T.H.-Y. Meng. Automatic gate-level synthesis of speed-independent circuits. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 581–587. IEEE Computer Society Press, November 1992.

   Google Scholar 

3. R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.

   Article  Google Scholar 

4. S. M. Burns. General condition for the decomposition of state holding elements. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems. IEEE Computer Society Press, March 1996.

   Google Scholar 

5. T.-A. Chu and L. A. Glasser. Synthesis of self-timed control circuits form graphs: An example. In Proc. International Conf. Computer Design (ICCD), pages 565–571. IEEE Computer Society Press, 1986.

   Google Scholar 

6. J. Cortadella. Combining structural and symbolic methods for the verification of concurrent systems. In Proc. of the International Conference on Application of Concurrency to System Design, pages 2–7, March 1998.

   Google Scholar 

7. Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, and Alexandre Yakovlev. Decomposition and technology mapping of speed-independent circuits using Boolean relations. IEEE Transactions on Computer-Aided Design, 18(9), September 1999.

   Google Scholar 

8. Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Automatic handshake expansion and reshuffling using concurrency reduction. In Proc. of the Workshop Hardware Design and Petri Nets (within the International Conference on Application and Theory of Petri Nets), pages 86–110, June 1998.

   Google Scholar 

9. Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexandre Yakovlev. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers, 47(8):859–882, August 1998.

   Article  MathSciNet  Google Scholar 

10. Al Davis and Steven M. Nowick. An introduction to asynchronous circuit design. In A. Kent and J. G. Williams, editors, The Encyclopedia of Computer Science and Technology, volume 38. Marcel Dekker, New York, February 1998.

    Google Scholar 

11. J. Desel and J. Esparza. Free-choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.

    Google Scholar 

12. J. Desel and W. Reisig. The synthesis problem of Petri nets. Acta Informatica, 33(4):297–315, 1996.

    Article  MathSciNet  Google Scholar 

13. David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1989.

    Google Scholar 

14. A. Ehrenfeucht and G. Rozenberg. Partial (Set) 2-Structures. Part I, II. Acta Informatica, 27:315–368, 1990.

    Article  MathSciNet  Google Scholar 

15. P. Godefroid. Using partial orders to improve automatic verification methods. In E.M Clarke and R.P. Kurshan, editors, Proc. International Workshop on Computer Aided Verification, 1990. DIMACS Series in Discrete Mathematica and Theoretical Computer Science, 1991, pages 321–340.

    Google Scholar 

16. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

17. H. Hulgaard, S. M. Burns, T. Amon, and G. Borriello. An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Transactions on Computers, 44(11):1306–1317, November 1995.

    Article  Google Scholar 

18. Michael Kishinevsky, Alex Kondratyev, Alexander Taubin, and Victor Varshavsky. Concurrent Hardware: The Theory and Practice of Self-Timed Design. Series in Parallel Computing. John Wiley & Sons, 1994.

    Google Scholar 

19. Alex Kondratyev, Michael Kishinevsky, Alexander Taubin, and Sergei Ten. Analysis of Petri nets by ordering relations in reduced unfoldings. Formal Methods in System Design, 12(1):5–38, January 1998.

    Article  Google Scholar 

20. Alex Kondratyev, Michael Kishinevsky, and Alex Yakovlev. Hazard-free implementation of speed-independent circuits. IEEE Transactions on Computer-Aided Design, 17(9):749–771, September 1998.

    Article  Google Scholar 

21. A. Kovalyov. A Polynomial Algorithm to Compute the Concurrency Relation of a Regular STG. In A. Yakovlev, L. Gomesa, and L. Lavagno, editors, Hardware Design and Petri Nets, pages 107–126. Kluwer Academic Publishers, March 2000.

    Google Scholar 

22. Luciano Lavagno and Alberto Sangiovanni-Vincentelli. Algorithms for Synthesis and Testing of Asynchronous Circuits. Kluwer Academic Publishers, 1993.

    Google Scholar 

23. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

    Google Scholar 

24. K. L. McMillan. Trace theoretic verification of asynchronous circuits using unfoldings. In Proc. International Workshop on Computer Aided Verification, 1995.

    Google Scholar 

25. G.H. Mealy. A method for synthesizing sequential circuits. Bell System Technical J., 34(5):1045–1079, 1955.

    Article  MathSciNet  Google Scholar 

26. E.F. Moore. Gedanken experiments on sequential machines. Automata Studies, pages 129–153, 1956.

    Google Scholar 

27. David E. Muller. Asynchronous logics and application to information processing. In Symposium on the Application of Switching Theory to Space Technology, pages 289–297. Stanford University Press, 1962.

    Google Scholar 

28. David E. Muller and W. S. Bartky. A theory of asynchronous circuits. In Proceedings of an International Symposium on the Theory of Switching, pages 204–243. Harvard University Press, April 1959.

    Google Scholar 

29. T. Murata. Petri Nets: Properties, analysis and applications. Proceedings of the IEEE, pages 541–580, April 1989.

    Google Scholar 

30. Chris J. Myers and Teresa H.-Y. Meng. Synthesis of timed asynchronous circuits. IEEE Transactions on VLSI Systems, 1(2):106–119, June 1993.

    Article  Google Scholar 

31. S. M. Nowick and B. Coates. Automated design of high-performance asynchronous state machines. In Proc. International Conf. Computer Design (ICCD). IEEE Computer Society Press, October 1994.

    Google Scholar 

32. E. Pastor, J. Cortadella, and M.A. Peña. Structural methods to improve the symbolic analysis of Petri nets. In Application and Theory of Petri Nets 1999, Lecture Notes in Computer Science, June 1999.

    Google Scholar 

33. Enric Pastor, Jordi Cortadella, Alex Kondratyev, and Oriol Roig. Structural methods for the synthesis of speed-independent circuits. IEEE Transactions on Computer-Aided Design, 17(11):1108–1129, November 1998.

    Article  Google Scholar 

34. C. A. Petri. Kommunikation mit Automaten. PhD thesis, Bonn, Institut für Instrumentelle Mathematik, 1962. (technical report Schriften des IIM Nr. 3).

    Google Scholar 

35. petrify: a tool for the synthesis of Petri nets and asynchronous controllers. http://www.lsi.upc.es/~jordic/petrify.

36. W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science. Springer-Verlag, 1998.

    MATH  Google Scholar 

37. Oriol Roig, Jordi Cortadella, and Enric Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. In 16th International Conference on the Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 374–391, 1995.

    Google Scholar 

38. L. Y. Rosenblum and A. V. Yakovlev. Signal graphs: from self-timed to timed ones. In Proceedings of International Workshop on Timed Petri Nets, pages 199–207, Torino, Italy, July 1985. IEEE Computer Society Press.

    Google Scholar 

39. A. Valmari. Stubborn sets for reduced state space generation. In Lecture Notes in Computer Science, Advances in Petri Nets 1990, volume 483, pages 491–515. Springer Verlag, 1991.

    Article  MathSciNet  Google Scholar 

Download references