• DocumentCode
    2480986
  • Title

    Identification of unbounded Petri nets from their coverability graph

  • Author

    Cabasino, Maria Paola ; Giua, Alessandro ; Seatzu, Carla

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Cagliari Univ.
  • fYear
    2006
  • fDate
    13-15 Dec. 2006
  • Firstpage
    434
  • Lastpage
    440
  • Abstract
    We solve the following problem: given an automaton that represents the coverability graph of a net, determine a net system whose coverability graph is isomorph to the automaton. Our approach requires solving an integer programming problem whose set of unknowns contains the elements of the pre and post incidence matrices and the initial marking of the net
  • Keywords
    Petri nets; automata theory; graph theory; identification; integer programming; matrix algebra; automaton; coverability graph; incidence matrix; integer programming; unbounded Petri net identification; Automata; Character generation; Constraint theory; Control systems; Data mining; Linear programming; Petri nets; Production; Stress; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2006 45th IEEE Conference on
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    1-4244-0171-2
  • Type

    conf

  • DOI
    10.1109/CDC.2006.377769
  • Filename
    4177879
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2480986