New Priority-Lists for Scheduling in Timed Petri Nets. - Toshimasa Watanabe; Masahiro Yamauchi (Application and Theory of Petri Nets, 1993)

An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets. - Masahiro Yamauchi; Toshimasa Watanabe (ISCAS, 1994)

Extracting siphons containing a specified set of places in a Petri net. - Masahiro Yamauchi; Shinji Tanimoto; Toshimasa Watanabe (SMC, 1998)

A heuristic algorithm FSD for the legal firing sequence problem of Petri nets. - Masahiro Yamauchi; Toshimasa Watanabe (SMC, 1998)

A heuristic algorithm SDS for scheduling with timed Petri nets. - Masahiro Yamauchi; Toshimasa Watanabe (ISCAS (6), 1999)

Two efficient methods for computing Petri net invariants. - Katsishi Takano; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (SMC, 2001)

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. - Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. - Satoru Shimada; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (ISCAS, 2006)

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets. - Satoru Ochiiwa; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. - Satoru Ochiiwa; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)