Kohkichi Tsuji

According to our database, Kohkichi Tsuji authored at least 13 papers between 1993 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets.

Atsushi Ohta, Kohkichi Tsuji

Proceedings of the 59th Annual Conference of the Society of Instrument and Control Engineers of Japan, 2020

2012

Decidability Analysis of Some Classes of Extended Function Petri Net.

Atsushi Ohta, Kohkichi Tsuji

Proceedings of the Third International Conference on Networking and Computing, 2012

2011

Verifying Structurally Weakly Persistent Net Is Co-NP Complete.

Atsushi Ohta, Kohkichi Tsuji

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2009

Computational Complexity of Liveness Problem of Normal Petri Net.

Atsushi Ohta, Kohkichi Tsuji

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2006

Structural analysis of Petri nets with batch processing arcs.

Atsushi Ohta, Chihiro Kato, Kohkichi Tsuji

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

2005

Minimal time reachability problem of some subclasses of timed Petri nets.

Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2004

Unfolding of Petri nets with semilinear reachability set.

Atsushi Ohta, Kohkichi Tsuji

Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

2003

Insufficiently marked siphon of Petri nets - extension of token-free siphon.

Atsushi Ohta, Kohkichi Tsuji

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2002

NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net.

Atsushi Ohta, Kohkichi Tsuji

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2000

On a new type of extended Petri nets and its applications.

Kohkichi Tsuji

Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

1993

On reachability conditions for unrestricted Petri nets.

Kohkichi Tsuji, Tadao Murata

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

The minimum number of live minimal structural traps to make an arbitrary minimal structural deadlock lve in general Petri nets.

Tadashi Matsumoto, Ken Saikusa, Kohkichi Tsuji

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

On Parallel Symbolic Analysis of Large Networks and Systems.

Tadashi Matsumoto, Tetsuya Sakabe, Kohkichi Tsuji

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993