| 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 # | |
| SS | 2020-03-05 12:05 |
Okinawa | (Cancelled but technical report was issued) |
An Approach of Deriving Hazard Transition Series by Cooperation of STAMP/STPA and Model Checking Pan Yang, Kozo Okano, Shinpei Ogata (Shinshu Univ.), Keishi Okamoto (Sendai National College of Tech.)  SS2019-56 |
The demand for research on the hazard analysis of information systems and the construction of countermeasures have been ... [more] | SS2019-56 pp.93-98 |
| DC, SS | 2019-10-24 14:30 |
Kumamoto | Kumamoto Univ. | Computing Optimal Weight in Weighted Register Automata and Related Decision Problems Reo Yoshimura (Nagoya Univ.), Yoshiaki Takata (Kochi-tech.), Hiroyuki Seki (Nagoya Univ.) SS2019-16 DC2019-44 |
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] | SS2019-16 DC2019-44 pp.19-24 |
| SS | 2018-03-06 11:30 |
Okinawa | Model Checking Application to the Railway Crossing Problem for STAMP/STPA using Timed Automaton Kozo Okano, Shinpei Ogata, Pan Yang (Shinshu Univ.), Keishi Okamoto (Sendai National College of Tech.) SS2017-64 |
Recent rapid growth of information systems makes us pay attention to methods for analysis of accident causation and pr... [more] |
SS2017-64 pp.1-6 |
|
| SWIM | 2014-08-21 14:35 |
Kyoto | Ryukoku Univ.Ouniya Canvas | Validation of UML Timing Diagrams Using Timed Automata Kengo Kajimura, Yoshiyuki Shinkawa (Ryukoku Univ.) SWIM2014-11 |
Originally, UML had mainly been widely used as a model description language for analyzing, designing, manufacturing and ... [more] | SWIM2014-11 pp.17-21 |
| KBSE, SS, IPSJ-SE [detail] | 2014-07-10 10:00 |
Hokkaido | Furano-Bunka-Kaikan | A cost-aware scheduling for real-time tasks based on the priced task automta Shoji Yuen, Tatsuro Kamei (Nagoya Univ.) SS2014-11 KBSE2014-14 |
This report presents a technique to give the optimal cost with respect to time passage when a set of tasks are schedul... [more] |
SS2014-11 KBSE2014-14 pp.37-42 |
| USN, AN, IPSJ-UBI (Joint) [detail] |
2012-05-17 15:25 |
Aichi | Toyohashi University of Technology | Modeling home appliance power consumption by interval-based switching Kalman filters Kohei Haze, Takekazu Kato, Takashi Matsuyama (Kyoto Univ.) USN2012-4 |
This paper describes power consumption pattern modeling for home appliances. The power consumption model realizes power... [more] |
USN2012-4 pp.39-44 |
| SWIM | 2010-11-19 15:25 |
Tokyo | Tokai Univ. Takanawa Campus(Tokyo) | Verification of UML Sequence Diagrams with Time Constraints Yoshihiro Yasuda, Yoshiyuki Shinkawa (Ryukoku Univ.) SWIM2010-23 |
Verification of the system specification is usually performed independently from three major different viewpoints, that ... [more] | SWIM2010-23 pp.39-44 |
| SS | 2010-08-05 15:00 |
Hokkaido | Asahikawa Shimin-Bunka-Kaikan (Civic Culture Hall) | Reachability Analysis for Timed Systems using Parallel Processing Toshiaki Tanaka, Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2010-22 |
This report proposes efficient parallel processing of reachability analysis for timed automaton. Our research group has ... [more] | SS2010-22 pp.35-40 |
| KBSE, SS | 2010-05-28 14:25 |
Kyoto | Doshisha University, Imadegawa Campus | Symbolic Verification Method of Priced Probabilistic Timed Automaton with Spaces Katsuya Hatanaka, Hiroshi Kamazawa, Satoshi Yamane (Kanazawa Univ.) SS2010-13 KBSE2010-13 |
Recently, wireless sensor networks attracts attention in various fields. Moreover, with the making of the embedded syste... [more] | SS2010-13 KBSE2010-13 pp.75-79 |
| SS | 2010-03-08 09:00 |
Kagoshima | Kagoshima Univ. | Reachability Analysis for Probabilistic Timed System based on Timed Abstraction Refinement Technique Akihiko Ito, Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2009-62 |
This paper gives a reachability analysis technique for Probabilistic Timed Automaton (PTA), based on CEGAR loop. The pro... [more] | SS2009-62 pp.85-90 |
| MSS | 2009-06-03 14:00 |
Osaka | Setsunan University, Osaka Center | Proposal of Priced probabilistic Timed Automaton with concept of Space, and its Application to Sensor Netwrok Hiroshi Kamazawa, Satoshi Yamane (Kanazawa Univ.) CST2009-2 |
Recently,wireless sensor networks attract attention in various fields. However,as the spatiality such as the range of th... [more] | CST2009-2 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 |
| VLD | 2009-03-12 15:15 |
Okinawa | Formal verification of GALS system designs using UPPAAL Kazuaki Kirita, Tomoyuki Yokogawa, Hisashi Miyazaki, Yoichiro Sato, Michiyoshi Hayase (Okayama Pref. Univ.) VLD2008-150 |
To design GALS (Globally Asynchronous Locally Synchronous) systems, it is necessary to verify the correctness of behavi... [more] |
VLD2008-150 pp.141-146 |
|
| 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 |
| SS | 2008-03-04 11:25 |
Nagasaki | Nagasaki Univ. | Abstraction of Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2007-74 |
We have proposed a method of model abstraction for timed automata.The proposed method is based on CEGAR (CounterExample... [more] | SS2007-74 pp.103-108 |
| MSS | 2007-08-31 14:45 |
Shimane | Shimane University | Design Verification Technique of A Soft Real-Time System using UML and Utility Function Satoshi Yamane, Masaaki Sakakura (Kanazawa Univ.) CST2007-15 |
Recently, in the real-time systems used in many scenes, soft real-time systems, which are not strict by the deadline, ... [more] |
CST2007-15 pp.25-30 |
| COMP | 2007-04-26 14:25 |
Kyoto | Katsura Campus, Kyoto University | Implementation of Probabilistic Timed Strong Simulation Algorithm Yuki Hasizume, Satoshi Yamane (Kanazawa Univ.) COMP2007-6 |
It is useful for real-time systems with probabilistic behaviors to verify formally probabilistic timed automata. Probabi... [more] | COMP2007-6 pp.41-48 |
| MSS | 2006-07-26 13:25 |
Kyoto | Kyoto Institute of Technology | Development of strong probabilistic timed simulation verifier of probabilistic timed automata Satoshi Yamane, Hiroshi Kodera, Tsuneo Arai (Kanazawa Univ.) |
In 2003, we have shown the decidability of the problem：「On the "Probabilistic Timed Automata", Strong Probabilistic Ti... [more] |
CST2006-15 pp.31-35 |
| MSS, CAS | 2005-11-10 10:55 |
Yamaguchi | Yamaguchi University | An Application of State Feedback Control to Scheduling of Periodic Tasks on Dynamic Reconfigurable Device Kenji Onogi, Toshimitsu Ushio (Osaka Univ.) |
A dynamic reconfigurable device is a device which can change its hardware configuration dynamically in order to achieve ... [more] | CAS2005-50 CST2005-19 pp.7-12 |
[Return to Top Page]