"Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed ..."

Satoru Ochiiwa et al. (2013)

> Home

Details and statistics

DOI: 10.1587/TRANSFUN.E96.A.540

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/OchiiwaTYW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/OchiiwaTYW13
Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(2): 540-553 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.