• DocumentCode
    2680611
  • Title

    A Disconnected 1-Safe Petri Net Whose Reachability Tree Is Homomorphic to a Complete Boolean Lattice

  • Author

    Kansal, Sangita ; Singh, Gajendra Pratap ; Acharya, Mukti

  • Author_Institution
    Dept. of Appl. Math., Delhi Technol. Univ., Delhi, India
  • fYear
    2011
  • fDate
    20-22 July 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Petri nets generating all the 2n binary n-vectors as their marking vectors are not only of theoretical interest but also are of practical importance. In this note, we demonstrate the existence of a disconnected 1-safe Petri net whose reachability tree is homomorphic to the n-dimensional complete lattice Ln. This makes the problem of characterizing the 1-safe Petri nets that generate all the binary n-vectors as marking vectors exactly once appear more intricate.
  • Keywords
    Boolean algebra; Petri nets; trees (mathematics); binary n-vector; complete Boolean lattice; disconnected 1-safe Petri net; reachability tree; Compounds; Computer science; Graph theory; Hamming distance; Lattices; Petri nets; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Process Automation, Control and Computing (PACC), 2011 International Conference on
  • Conference_Location
    Coimbatore
  • Print_ISBN
    978-1-61284-765-8
  • Type

    conf

  • DOI
    10.1109/PACC.2011.5979037
  • Filename
    5979037
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2680611