Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe. Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. IEICE Transactions, 96-A(2):540-553, 2013. [doi]

@article{OchiiwaTYW13,
  title = {Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets},
  author = {Satoru Ochiiwa and Satoshi Taoka and Masahiro Yamauchi and Toshimasa Watanabe},
  year = {2013},
  url = {http://search.ieice.org/bin/summary.php?id=e96-a_2_540},
  researchr = {https://researchr.org/publication/OchiiwaTYW13},
  cites = {0},
  citedby = {0},
  journal = {IEICE Transactions},
  volume = {96-A},
  number = {2},
  pages = {540-553},
}