Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SS |
2024-03-07 13:30 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Zone-Based Reachability Analysis of Nested Timed Automata Seiichiro Tachi (Nagoya Univ), Mizuhito Ogawa (JAIST), Shoji Yuen (Nagoya Univ) SS2023-53 |
We present a zone-based reachability analysis for Nested Timed Automata (NeTA).
NeTA is a timed pushdown automaton that... [more] |
SS2023-53 pp.25-30 |
SS, IPSJ-SE, KBSE [detail] |
2022-07-29 13:00 |
Hokkaido |
Hokkaido-Jichiro-Kaikan (Sapporo) (Primary: On-site, Secondary: Online) |
Verification of Implementable Timed Automata via Satisfiability Checking Seiichiro Tachi, Shoji Yuen (Nagoya Univ.) SS2022-9 KBSE2022-19 |
We present a technique for bounded model-checking the reachability in timed automata with implementability assuming that... [more] |
SS2022-9 KBSE2022-19 pp.49-54 |
NS, SR, RCS, SeMI, RCC (Joint) |
2022-07-15 13:40 |
Ishikawa |
The Kanazawa Theatre + Online (Primary: On-site, Secondary: Online) |
Performance Analysis of a Link Symmetry Confirmation Method in Backoff-based Opportunistic Routing Takuma Yamazaki (SIT), Eri Hosonuma (UT), Taku Yamazaki, Takumi Miyoshi, Thomas Silverston (SIT) NS2022-57 |
Backoff-based opportunistic routing autonomously selects a forwarder based on a random backoff time using hop counts. Ho... [more] |
NS2022-57 pp.147-150 |
NS, ICM, CQ, NV (Joint) |
2020-11-26 09:30 |
Online |
Online |
A Study on Path Reachability Including Distance-Constrained Detours Miyu Otani, Takanori Hara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ2020-49 |
When links and/or nodes are down in a network, the network may not function normally. Most of the existing work focuses ... [more] |
CQ2020-49 pp.10-15 |
VLD, DC, RECONF, ICD, IPSJ-SLDM (Joint) [detail] |
2020-11-17 09:55 |
Online |
Online |
Efficient computation of inductive invariant through flipflop selection Fudong Wang, Masahiro Fujita (U-Tokyo) VLD2020-20 ICD2020-40 DC2020-40 RECONF2020-39 |
As we all know, verification plays more and more important role in VLSI design and manufacture. However, it always takes... [more] |
VLD2020-20 ICD2020-40 DC2020-40 RECONF2020-39 pp.54-59 |
NLP, MSS (Joint) |
2019-03-14 13:45 |
Fukui |
Bunkyo Camp., Univ. of Fukui |
Implementation of Rigorous Simulator for Hybrid Systems Based on Duracz et al. 's Operational Semantics Shota Kojima, Daisuke Ishii (U. Fukui) MSS2018-84 |
Rigorous numerical simulation based on a safe approximation of states plays an important role in analysis of hybrid syst... [more] |
MSS2018-84 pp.19-22 |
MSS, CAS, IPSJ-AL [detail] |
2018-11-12 16:15 |
Shizuoka |
|
A Method for Improving Memory Efficiency of the Reachability Graph Generation Process in General Petri Nets Kohei Fujimori, Yojiro Harie, Katsumi Wasaki (Shinshu Univ.) CAS2018-65 MSS2018-41 |
State space generator is one of the analysis functions of Petri net
design tool HiPS (Hierarchical Petri net Simulator)... [more] |
CAS2018-65 MSS2018-41 pp.43-47 |
SS |
2018-03-06 12:00 |
Okinawa |
|
A symbolic Zone-based reachability analysis for dense-timed pushdown automata with freezing clocks Shoji Yuen, Sho Hiraoka (Nagoya Univ.) SS2017-65 |
We present a reachability analysis by the zone-based symbolic discretization
for dense-timed pushdown automata with fre... [more] |
SS2017-65 pp.7-12 |
ISEC, COMP |
2017-12-21 11:25 |
Kochi |
Eikokuji Campus, Kochi University of Technology |
O(n^{1/3})-space algorithm for the grid graph reachability problem Ryo Ashida, Kotaro Nakagawa (Tokyo Tech) ISEC2017-75 COMP2017-29 |
The directed graph reachability problem is a canonical complete problem for class NL.
The best known polynomial time al... [more] |
ISEC2017-75 COMP2017-29 pp.19-24 |
QIT (2nd) |
2017-11-17 10:00 |
Saitama |
Saitama University |
Limit on Quantum State Generation under Dissipation Kohei Kobayashi, Naoki Yamamoto (Keio Univ.) |
To realize quantum information technology, control for generating a target quantum state is highly necessary. However, i... [more] |
|
OCS, CS (Joint) |
2017-01-20 10:45 |
Fukuoka |
Kyushu Sangyo University |
Improvement of band narrowing characteristics of Simplified Optical Cross Connect for improving optical path reachability of elastic optical networks Baku Yatabe, Yurie Matsuyama, Hitoshi Takeshita, Shinsuke Fujisawa, Takeshi Nakata, Akio Tajima, Takehumi Oguma (NEC) OCS2016-68 |
In an elastic optical network that enables capacity expansion and flexibility improvement of optical communication syste... [more] |
OCS2016-68 pp.21-25 |
QIT (2nd) |
2016-11-24 13:00 |
Ibaraki |
KEK Kobayashi-hall |
[Poster Presentation]
Limit on Quantum State Generation under Dissipation Kohei Kobayashi, Naoki Yamamoto (Keio Univ.) |
To realize quantum information technology, control for generating a target quantum state is highly necessary. However, i... [more] |
|
OCS, NS, PN (Joint) |
2016-06-23 11:40 |
Hokkaido |
Hokkaido University |
Proposal and evaluation of a novel Simplified Optical Cross Connect Architecture for enhancement of reachability of elastic optical path Hitoshi Takeshita, Yurie Matsuyama, Takefumi Oguma, Shinsuke Fujisawa, Akio Tajima (NEC) OCS2016-12 |
Elastic optical network is promising because of its high spectral efficiency. But, it has a problem that reachability of... [more] |
OCS2016-12 pp.17-22 |
ET |
2016-03-05 16:15 |
Kagawa |
Kawaga Univ. (Saiwai-cho Campus) |
A Proposal for a Misconfiguration Detection Method based on Program Analysis Techniques for Network Construction Exercises for Beginners Yuichiro Tateiwa, Naohisa (NIT) ET2015-106 |
In this study, we propose a method that specifies regions (we call them fault regions) where misconfigurations concernin... [more] |
ET2015-106 pp.71-76 |
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2015-12-02 11:15 |
Nagasaki |
Nagasaki Kinro Fukushi Kaikan |
Improved Method of Simulated Annealing for Unreachable Solution Space Hiroyuki Nakano, Kunihiro Fujiyoshi (TUAT) VLD2015-45 DC2015-41 |
Simulated Annealing is a universal probabilistic metaheuristic for the general optimization problem of locating a good a... [more] |
VLD2015-45 DC2015-41 pp.45-50 |
MSS, SS |
2015-01-26 17:20 |
Tottori |
|
A Consideration on How to Model Check Distributed Snapshot Reachability Property Wenjie Zhang, Kazuhiro Ogata (JAIST), Min Zhang (ECNU) MSS2014-77 SS2014-41 |
The Chandy-Lamport Distributed Snapshot Algorithm (CLDSA) can determine a consistent global state (called a snapshot) of... [more] |
MSS2014-77 SS2014-41 pp.49-54 |
COMP |
2014-10-08 14:45 |
Tokyo |
Chuo University |
Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29 |
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] |
COMP2014-29 pp.19-24 |
CS, NS, IN (Joint) |
2014-09-11 10:50 |
Miyagi |
Tohoku Univ. Research Institute of Electrical Communication 2gokan |
Designing Method of Radio Transmission Range to Improve both Communication Reachability and Power Saving based on Target Problem Ryo Hamamoto, Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.), Kenji Ishida (Hiroshima City Univ.) NS2014-82 |
In recent years, an ad hoc network which can be configured autonomously by terminals without network infrastructures suc... [more] |
NS2014-82 pp.13-18 |
COMP |
2013-04-24 10:00 |
Hyogo |
Kobe University |
Answering Reachability Queries by Extending Pruned BFSs to Paths Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-1 |
The graph reachability is a fundamental problem, both theoretically and practically. However, it is still a challenging ... [more] |
COMP2013-1 pp.1-8 |
MSS |
2013-01-22 14:25 |
Osaka |
Osaka Int. Convention Center |
On Polynomial Time Checking on Reachability in Sound Extended Free-Choice Workflow Nets Daiki Kano, Shingo Yamaguchi (Yamaguchi Univ.) MSS2012-48 |
There are two aspects of a workflow: definition and instance.
In this paper, we tackle verification of correctness of w... [more] |
MSS2012-48 pp.17-21 |