Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe. Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Transactions, 88-A(11):3051-3061, 2005. [doi]

The following publications are possibly variants of this publication:

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri NetsSatoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe. ieicet, 92-A(11):2732-2744, 2009. [doi]

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

Heuristic algorithms for the marking construction problem of Petri netsSatoshi Taoka, Toshimasa Watanabe. iscas 2010: 1344-1347 [doi]

A new heuristic method for solving the minimum initial marking problem of Petri netsShin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe. SMC 2000: 3218-3223 [doi]

The Marking Construction Problem of Petri Nets and Its Heuristic AlgorithmsSatoshi Taoka, Toshimasa Watanabe. ieicet, 94-A(9):1833-1841, 2011. [doi]

runs on WebDSL