• DocumentCode
    1896711
  • Title

    A new lock based state coding methodology for signal transition graphs

  • Author

    Nagalla, Radhakrishna

  • Author_Institution
    Sch. of Comput. Sci. & Eng., New South Wales Univ., Kensington, NSW, Australia
  • Volume
    6
  • fYear
    1998
  • fDate
    31 May-3 Jun 1998
  • Firstpage
    179
  • Abstract
    In this paper a new approach for enforcing complete state coding (CSC) property in signal transition graph (STG) specifications will be discussed. As a novel contribution we propose a lock based methodology to ascertain whether a given STG has complete state coding (CSC) property. Unlike most of the existing methods which operate on a state graph, our method operates on the STG. This approach has the advantage of being either easily automated or easier to visually correlate with the STG specifications. Experimental results with a large number of practical asynchronous bench marks are presented
  • Keywords
    Petri nets; asynchronous circuits; signal flow graphs; asynchronous benchmarks; complete state coding; interpreted Petri nets; lock based state coding methodology; signal transition graphs; Australia; Automatic control; Bipartite graph; Circuit synthesis; Computer science; Data structures; Logic circuits; Petri nets; Runtime; Signal synthesis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on
  • Conference_Location
    Monterey, CA
  • Print_ISBN
    0-7803-4455-3
  • Type

    conf

  • DOI
    10.1109/ISCAS.1998.705241
  • Filename
    705241