| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS | 2013-01-22 14:50 |
Osaka | Osaka Int. Convention Center | On Analysis on Reachability to Unsafe Markings in Free Choice Workflow Nets Yuki Murakami, Ichiro Toyoshima, Shingo Yamaguchi (Yamaguchi Univ.)  MSS2012-49 |
In the Free Choice Workflow net, the marking always reach to non-safety marking means that the workflow's instance can... [more] | MSS2012-49 pp.23-26 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2012-07-19 15:25 |
Hokkaido | Quantitative evaluation on effectiveness of privacy protection for facial images Yuta Nakashima (NAIST), Tomoaki Ikeno, Noboru Babaguchi (Osaka Univ.) ISEC2012-17 SITE2012-13 ICSS2012-19 EMM2012-9 |
Images and videos usually contain privacy sensitive information (PSI) such as faces; therefore, publishing such images a... [more] | ISEC2012-17 SITE2012-13 ICSS2012-19 EMM2012-9 pp.59-66 |
|
| COMP | 2011-12-16 11:15 |
Aichi | Nagoya Univ. | Reconfiguration of Vertex Covers in Trees and Cacti Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-39 |
We study the problem of reconfiguring a vertex cover of a graph $G$ into another vertex cover via vertex covers of $G$, ... [more] |
COMP2011-39 pp.25-32 |
| CAS, MSS | 2011-11-18 11:15 |
Yamaguchi | Univ. of Yamaguchi | On Reachability Verification for Acyclic Well-Structured Work Shinji Hamano, Shingo Yamaguchi (Yamaguchi Univ.) CAS2011-78 MSS2011-47 |
Workflow nets are making great contributions for modeling and analysis of workflows. In this paper, we tackle verificat... [more] |
CAS2011-78 MSS2011-47 pp.83-87 |
| MSS, CAS | 2010-11-18 10:55 |
Osaka | Kansai Univ. | A Probability-based State Space Analysis of Petri Nets Eleazar Jimenez Serrano (Kyushu Univ.) CAS2010-66 CST2010-39 |
We present a partial exploration metaheuristic method of state spaces derived from Petri nets for the analysis of reacha... [more] | CAS2010-66 CST2010-39 pp.7-12 |
| DC | 2010-10-14 15:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg | Accelerating State Reachability Analysis with a GPU Yoshimitsu Nakada, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) DC2010-22 |
Reachability analysis is the process of exploring the state space of a system under verification. This step is fundament... [more] | DC2010-22 pp.25-29 |
| MSS | 2010-08-02 14:50 |
Ishikawa | A Method for Obtainning Discrete System from Steady-State Continuous System Tadashi Matsumoto, Masahiro Osogami (Fukui Univ. of Tech.), Seiichiro Moro (Univ. of Fukui) CST2010-34 |
From the given continuous system$Ax = b ( A = [ a_{ij}] \in R^{m \times n}, b = [ b_i] \in R^{m \times 1}), $proposals f... [more] | CST2010-34 pp.13-18 |
|
| AN | 2010-07-15 13:50 |
Hokkaido | Hakodate City Central Library | Reachability Improvement of Face Routing Protocol in Unreliable Wireless Environments Tomokazu Ezaki, Hiroaki Higaki (Tokyo Denki Univ.) AN2010-11 |
In ad-hoc routing protocols such as Face, GEDIR and GPSR, a wireless multihop transmission route from a source node to a... [more] | AN2010-11 pp.7-12 |
| MSS | 2009-06-03 16:50 |
Osaka | Setsunan University, Osaka Center | [Invited Talk]
Probabilic Timed CEGAR Atsushi Morishita, Ryota Komagata, Satoshi Yamane (Kanazawa Univ.) CST2009-5 |
In this paper, we present an efficient verification method for probabilic timed automaton. This method based on predicat... [more] | CST2009-5 pp.25-30 |
| MSS | 2009-06-04 10:25 |
Osaka | Setsunan University, Osaka Center | On Reachability Analysis of Multi Agent Nets by Using Modular Petri Nets Kyota Horiguchi, Toshiyuki Miyamoto (Osaka Univ.) CST2009-6 |
Multi agent net is a formal model description language for multi agent systems. As a variant of Petri nets, modular Petr... [more] | CST2009-6 pp.31-36 |
| IN, NS (Joint) |
2009-03-04 09:00 |
Okinawa | Okinawa-Zanpamisaki Royal Hotel | Enhancements of ODMRP for Improving Packet Reachability in Ad Hoc Networks Takahiko Kibe, Toyofumi Takenaka (Nihon Univ.) NS2008-226 |
An Ad Hoc network is a set of wireless terminals and almost of them have the characteristics of mobility and portability... [more] | NS2008-226 pp.469-472 |
| SS | 2009-03-02 17:00 |
Saga | Saga University | [Invited Talk]
Model Checking of Timed Automata Akio Nakata (Hiroshima City Univ.) SS2008-53 |
In this paper, we briefly describe model checking of timed automata, one of the verification techniques of real-time sys... [more] | SS2008-53 pp.29-34 |
| MSS | 2009-01-29 14:15 |
Kanagawa | Kanagawa Industrial Promotion Center | An Algorithm for the Marking Construction Problem of Petri Nets Enhanced by a MAX-LFS Algorithm and Improvement of Post-processing Toshihisa Ishii, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-44 |
The marking construction problem ({\bf MCP}) of Petri nets is defined as follows. ``Given a Petri net $N$, an initial... [more] |
CST2008-44 pp.17-22 |
| MSS | 2009-01-30 09:55 |
Kanagawa | Kanagawa Industrial Promotion Center | Modeling and Verification of Hybrid Systems using Boolean Differential Constraints Daisuke Ishii, Kazunori Ueda (Waseda Univ.), Hiroshi Hosobe (National Inst. of Info.) CST2008-53 |
We propose a bounded model checking method for reachability analysis of hybrid systems. In our method, a nonlinear hybri... [more] | CST2008-53 pp.67-70 |
| CAS, MSS | 2008-11-06 16:15 |
Osaka | Osaka University | Predicate Abstraction and Refinement of Parallel Behaviour of Hierarchical Timed Automata Shinichi Yamazaki, Satoshi Yamane, Masatoshi Yasui (Kanazawa Univ.) CAS2008-50 CST2008-28 |
In this paper, we propose the predicate abstraction and refinement verification method for the paralell hierarchical tim... [more] | CAS2008-50 CST2008-28 pp.31-36 |
| MSS | 2008-06-03 10:50 |
Aichi | Nagoyo University, Noyori Conference Hall | Reachability analysis method of probabilistic timed automaton based on predicate abstraction and its refinement Ryota Komagata, Atsushi Morishita, Satoshi Yamane (Kanazawa Univ.) CST2008-5 |
In this paper, we first define the Probabilic Timed Automaton. Next, we present an efficient verification method for Pro... [more] | CST2008-5 pp.1-6 |
| ICM | 2008-03-14 14:35 |
Okinawa | Rapid test of node reachability with congestion control and its evaluation Naoki Tateishi, Mitsuho Tahara, Yu Miyoshi, Souhei Majima (NTT) TM2007-67 |
Most ISPs and telecom carreers test reacheability to their nodes and interfaces by SNMP or ICMP echo. But it takes a lon... [more] | TM2007-67 pp.85-90 |
|
| NS, IN (Joint) |
2008-03-07 09:15 |
Okinawa | Bankoku Shinryokan | Enhancements of ODMRP for Improving Packet Reachability in Ad Hoc Networks Takahiko Kibe, Toyofumi Takenaka (Nihon Univ) NS2007-184 |
An Ad Hoc network is a set of wireless terminals and almost of them have the characteristics of mobility and portability... [more] | NS2007-184 pp.295-298 |
| MSS, CAS | 2007-11-30 13:25 |
Niigata | Niigata University | An Algebraic Approach to Rechability Problems of P/T Petri Nets Tadashi Matsumoto, Masahiro Osogami (Fukui Univ. of Tech.), Seiichiro Moro (Fukui Univ.) CAS2007-78 CST2007-29 |
P/T Petri nets are one of useful models for discrete event systems. In this paper, an algebraic approach to reachabili... [more] |
CAS2007-78 CST2007-29 pp.27-30 |
| IA | 2007-10-25 16:15 |
Fukuoka | Fukuoka SRP Center Building | The analysis of connectivity over internet traffic using passive measurement Hiroaki Towata, Koji Okamura (Kyushu Univ.) IA2007-34 |
We devise the method that understanding the connectivity by using information and transportation which already exist on ... [more] | IA2007-34 pp.21-26 |
[Return to Top Page]