default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKohkichi Tsuji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j3]Atsushi Ohta, Kohkichi Tsuji:
Verifying Structurally Weakly Persistent Net Is Co-NP Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2832-2835 (2011)- 2009
- [j2]Atsushi Ohta, Kohkichi Tsuji:
Computational Complexity of Liveness Problem of Normal Petri Net. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11): 2717-2722 (2009) - 2002
- [j1]Atsushi Ohta, Kohkichi Tsuji:
NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1071-1074 (2002)
Conference and Workshop Papers
- 2020
- [c10]Atsushi Ohta, Kohkichi Tsuji:
Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets. SICE 2020: 1569-1574 - 2012
- [c9]Atsushi Ohta, Kohkichi Tsuji:
Decidability Analysis of Some Classes of Extended Function Petri Net. ICNC 2012: 414-419 - 2006
- [c8]Atsushi Ohta, Chihiro Kato, Kohkichi Tsuji:
Structural analysis of Petri nets with batch processing arcs. ISCAS 2006 - 2005
- [c7]Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura:
Minimal time reachability problem of some subclasses of timed Petri nets. ISCAS (1) 2005: 760-763 - 2004
- [c6]Atsushi Ohta, Kohkichi Tsuji:
Unfolding of Petri nets with semilinear reachability set. ISCAS (4) 2004: 501-504 - 2003
- [c5]Atsushi Ohta, Kohkichi Tsuji:
Insufficiently marked siphon of Petri nets - extension of token-free siphon. ISCAS (3) 2003: 244-247 - 2000
- [c4]Kohkichi Tsuji:
On a new type of extended Petri nets and its applications. ISCAS 2000: 192-195 - 1993
- [c3]Tadashi Matsumoto, Tetsuya Sakabe, Kohkichi Tsuji:
On Parallel Symbolic Analysis of Large Networks and Systems. ISCAS 1993: 1647-1650 - [c2]Kohkichi Tsuji, Tadao Murata:
On reachability conditions for unrestricted Petri nets. ISCAS 1993: 2713-2716 - [c1]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: 2717-2720
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
