default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNguyen Van Tang
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j6]Yoriyuki Yamagata
, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi:
A formal semantics of extended hierarchical state transition matrices using CSP#. Formal Aspects Comput. 26(5): 943-962 (2014)- [j5]Eun-Hye Choi, Hideaki Nishihara, Takahiro Ando, Nguyen Van Tang, Masahiro Aoki, Keiichi Yoshisaka, Osamu Mizuno, Hitoshi Ohsaki:
Formal Specification Based Automatic Test Generation for Embedded Network Systems. J. Appl. Math. 2014: 909762:1-909762:21 (2014) - 2013
- [c6]Thi Bich Ngoc Do, Takashi Kitamura, Nguyen Van Tang, Goro Hatayama, Shinya Sakuragi, Hitoshi Ohsaki:
Constructing test cases for n-wise testing from tree-based test models. SoICT 2013: 275-284 - 2012
- [j4]Yoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi:
Formal semantics of extended hierarchical state transition matrix by CSP. ACM SIGSOFT Softw. Eng. Notes 37(4): 1-8 (2012) - [c5]Nguyen Van Tang, Hitoshi Ohsaki:
On Model Checking for Visibly Pushdown Automata. LATA 2012: 408-419 - [c4]Nguyen Van Tang, Daisuke Souma, Goro Hatayama, Hitoshi Ohsaki:
Modeling and Validating the Train Fare Calculation and Adjustment System Using VDM++. VSTTE 2012: 163-178 - 2011
- [j3]Nguyen Van Tang, Hitoshi Ohsaki:
Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2794-2801 (2011)
2000 – 2009
- 2009
- [j2]Koichi Kobayashi, Kunihiko Hiraishi, Nguyen Van Tang:
Approximate Algorithm for Hybrid Model Predictive Control with Time-Varying Reference. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2046-2052 (2009) - [c3]Nguyen Van Tang, Mizuhito Ogawa:
Event-Clock Visibly Pushdown Automata. SOFSEM 2009: 558-569 - [c2]Nguyen Van Tang:
A Tighter Bound for the Determinization of Visibly Pushdown Automata. INFINITY 2009: 62-76 - 2008
- [j1]Nguyen Van Tang, Mizuhito Ogawa:
Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata. Inf. Media Technol. 3(4): 744-754 (2008) - 2006
- [c1]Nguyen Van Tang, Dang Van Hung, Mizuhito Ogawa:
Modeling Urgency in Component-Based Real-Time Systems. ASIAN 2006: 248-255
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-08-29 20:59 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:
