IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
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
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
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan