| 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 | 2009-06-03 14:25 |
Osaka | Setsunan University, Osaka Center | Model checking of cooperated systems consisting of CPU and DRP Shota Minami, Shingo Takinai, Satoshi Sekoguchi, Satoshi Yamane (Kanazawa Univ.)  CST2009-3 |
In this paper, we propose formal verification for cooperated systems consisting of CPU and DRP. First, we specify CPU as... [more] | CST2009-3 pp.13-18 |
| 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 |
| 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 |
| AI | 2007-12-13 15:00 |
Kyoto | Game theory for Design and Verification of Embedded Systems Satoshi Yamane (Kanazawa Univ.) AI2007-26 |
Embedded systems, from control systems to home information appliances, are increasingly deployed in safety-critical si... [more] |
AI2007-26 pp.31-36 |
|
| AI | 2007-12-13 15:30 |
Kyoto | Agents and Services for Oriental History Studies Satomi Kobayashi (Kyoto Univ.), Satoshi Yamane (Kanazawa Univ.) AI2007-27 |
Extended directory service is useful not only for company business transaction but also for research collaboration. We p... [more] | AI2007-27 pp.37-41 |
|
| 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 | 2006-06-01 15:05 |
Ishikawa | Ishikawa Science Park | Reachability analysis of probabilistic linear hybrid automaton based on predicate abstraction and its refinement Takaaki Kato (Kanazawa Univ.), Yosuke Mutsuda (NEC), Satoshi Yamane (Kanazawa Univ.) |
As ubiquitous computing has progressed, systems are embedded in widespread environments. Then it is important to guarant... [more] | CST2006-4 pp.19-24 |
| SS | 2006-04-20 15:40 |
Niigata | Niigata Univ., Igarashi Campus | Formal method of real-time statechart Manabu Tokuda, Satoshi Yamane (Kanazawa Univ.) |
Recently, real-time systems have been used in many fields, and they have become large. In this situation the formal spe... [more] |
SS2006-5 pp.25-30 |
| MSS, CAS | 2005-11-10 13:50 |
Yamaguchi | Yamaguchi University | Design Method of Embedded Systems Based on Probabilistic Timed Interface Theoeries Satoshi Yamane, Tsuneo Arai (Kanazawa Univ.) |
Embedded systems, from control systems to home information appliances, are increasingly deployed in safety-critical si... [more] |
CAS2005-54 CST2005-23 pp.29-34 |
| MSS, CAS | 2004-11-04 09:55 |
Aichi | Aichi Pref. Univ. | Symbolic reachability analysis method of probabilistic linear hybrid automata Yosuke Mutsuda, Satoshi Yamane (Kanazawa Univ.) |
We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. For the purpose... [more] |
CAS2004-43 CST2004-22 pp.7-12 |
| MSS, CAS | 2004-11-04 10:20 |
Aichi | Aichi Pref. Univ. | Reachability analysis method of nonlinear hybrid automata using approximation techniques Takashi Yamanzaki, Satoshi Yamane (Kanazawa Univ.) |
Hybrid systems are digital real-time systems that are embedded in analog environments. It is important to guarantee th... [more] |
CAS2004-44 CST2004-23 pp.13-17 |
[Return to Top Page]