Satoshi Taoka

The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms

Toshimasa Watanabe, Satoshi Taoka, Toshimasa Watanabe, 2011, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Heuristic algorithms for the marking construction problem of Petri nets

Toshimasa Watanabe, Satoshi Taoka, Toshimasa Watanabe, 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

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

Toshimasa Watanabe, Satoshi Taoka, Masahiro Yamauchi, 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets

Toshimasa Watanabe, Satoshi Taoka, Toshimasa Watanabe, 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants

Toshimasa Watanabe, Satoshi Taoka, Akihiro Taguchi, 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses

Toshimasa Watanabe, S. Taoka, T. Watanabe, 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph

Toshimasa Watanabe, Satoshi Taoka, Toshimasa Watanabe, 1994, ISAAC.