Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Satoru Ochiiwa' in GoogleThis author has not been identified. Look up 'Satoshi Taoka' in GoogleThis author has not been identified. Look up 'Masahiro Yamauchi' in GoogleThis author has not been identified. Look up 'Toshimasa Watanabe' in Google

runs on WebDSL