On Parallel Symbolic Analysis of Large Networks and Systems. - Tadashi Matsumoto 002; Tetsuya Sakabe; Kohkichi Tsuji (ISCAS, 1993)

The minimum number of live minimal structural traps to make an arbitrary minimal structural deadlock lve in general Petri nets. - Tadashi Matsumoto 002; Ken Saikusa; Kohkichi Tsuji (ISCAS, 1993)

On reachability conditions for unrestricted Petri nets. - Kohkichi Tsuji; Tadao Murata (ISCAS, 1993)

On a new type of extended Petri nets and its applications. - Kohkichi Tsuji (ISCAS, 2000)

NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net. - Atsushi Ohta; Kohkichi Tsuji (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Insufficiently marked siphon of Petri nets - extension of token-free siphon. - Atsushi Ohta; Kohkichi Tsuji (ISCAS (3), 2003)

Unfolding of Petri nets with semilinear reachability set. - Atsushi Ohta; Kohkichi Tsuji (ISCAS (4), 2004)

Minimal time reachability problem of some subclasses of timed Petri nets. - Atsushi Ohta; Kohkichi Tsuji; Tomiji Hisamura (ISCAS (1), 2005)

Structural analysis of Petri nets with batch processing arcs. - Atsushi Ohta; Chihiro Kato; Kohkichi Tsuji (ISCAS, 2006)

Computational Complexity of Liveness Problem of Normal Petri Net. - Atsushi Ohta; Kohkichi Tsuji (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Verifying Structurally Weakly Persistent Net Is Co-NP Complete. - Atsushi Ohta; Kohkichi Tsuji (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Decidability Analysis of Some Classes of Extended Function Petri Net. - Atsushi Ohta; Kohkichi Tsuji (ICNC, 2012)

Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets. - Atsushi Ohta; Kohkichi Tsuji (SICE, 2020)