Kohkichi Tsuji

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 1

Top Topics

Computational Complexity

Service Composition

Top Venues

Publications

Atsushi Ohta, Kohkichi Tsuji
Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets. SICE (2020)
Atsushi Ohta, Kohkichi Tsuji
Decidability Analysis of Some Classes of Extended Function Petri Net. ICNC (2012)
Atsushi Ohta, Kohkichi Tsuji
Verifying Structurally Weakly Persistent Net Is Co-NP Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2011)
Atsushi Ohta, Kohkichi Tsuji
Computational Complexity of Liveness Problem of Normal Petri Net. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2009)
Atsushi Ohta, Chihiro Kato, Kohkichi Tsuji
Structural analysis of Petri nets with batch processing arcs. ISCAS (2006)
Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura
Minimal time reachability problem of some subclasses of timed Petri nets. ISCAS (1) (2005)
Atsushi Ohta, Kohkichi Tsuji
Unfolding of Petri nets with semilinear reachability set. ISCAS (4) (2004)
Atsushi Ohta, Kohkichi Tsuji
Insufficiently marked siphon of Petri nets - extension of token-free siphon. ISCAS (3) (2003)
Atsushi Ohta, Kohkichi Tsuji
NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2002)
Kohkichi Tsuji
On a new type of extended Petri nets and its applications. ISCAS (2000)
Tadashi Matsumoto, Ken Saikusa, Kohkichi Tsuji
The minimum number of live minimal structural traps to make an arbitrary minimal structural deadlock lve in general Petri nets. ISCAS (1993)
Kohkichi Tsuji, Tadao Murata
On reachability conditions for unrestricted Petri nets. ISCAS (1993)
Tadashi Matsumoto, Tetsuya Sakabe, Kohkichi Tsuji
On Parallel Symbolic Analysis of Large Networks and Systems. ISCAS (1993)