• DocumentCode
    3632761
  • Title

    Coverability Problems for Jumping Petri Nets

  • Author

    Cristian Vidrascu

  • Author_Institution
    Fac. of Comput. Sci., Univ. "Al. I. Cuza" of Iasi, Iasi, Romania
  • fYear
    2008
  • Firstpage
    158
  • Lastpage
    163
  • Abstract
    In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable jumping Petri nets.Also, as future work, we discuss some ideas for parallel implementations of the decision procedures for these problems.
  • Keywords
    "Petri nets","Power system modeling","Terminology","Scientific computing","Computer science","Mathematical model","Hardware","Tree graphs"
  • Publisher
    ieee
  • Conference_Titel
    Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC ´08. 10th International Symposium on
  • Print_ISBN
    978-0-7695-3523-4
  • Type

    conf

  • DOI
    10.1109/SYNASC.2008.82
  • Filename
    5204804
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3632761