Kohkichi Tsuji

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