Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton
Crossref DOI link: https://doi.org/10.1007/s10015-015-0215-z
Published Online: 2015-07-21
Published Print: 2015-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nakamura, Ryosuke
Sawada, Kenji
Shin, Seiichi
Kumagai, Kenji
Yoneda, Hisato
Text and Data Mining valid from 2015-07-21