中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Bisimulations and logical characterizations on continuous-time markov decision processes
Author: Song, Lei (1) ; Zhang, Lijun (2) ; Godskesen, Jens Chr. (3)
Conference Name: 15th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014
Conference Date: January 20, 2014 - January 21, 2014
Issued Date: 2014
Conference Place: San Diego, CA, United states
Publish Place: Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Indexed Type: EI
ISSN: 3029743
ISBN: 9783642540127
Department: (1) Max-Planck-Institut für Informatik, Saarland University, Saarbrücken, Germany; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (3) Programming, Logic, and Semantics Group, IT University of Copenhagen, Denmark
Abstract: In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For strong bisimulation, it is well known that it is strictly finer than the CSL equivalence. In this paper we propose strong and weak bisimulations for CTMDPs and show that for a subclass of CTMDPs, strong and weak bisimulations are both sound and complete with respect to the equivalences induced by CSL and the sub-logic of CSL without next operator respectively. We then consider a standard extension of CSL, and show that it and its sub-logic without X can be fully characterized by strong and weak bisimulations respectively over arbitrary CTMDPs. © 2014 Springer-Verlag Berlin Heidelberg.
English Abstract: In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For strong bisimulation, it is well known that it is strictly finer than the CSL equivalence. In this paper we propose strong and weak bisimulations for CTMDPs and show that for a subclass of CTMDPs, strong and weak bisimulations are both sound and complete with respect to the equivalences induced by CSL and the sub-logic of CSL without next operator respectively. We then consider a standard extension of CSL, and show that it and its sub-logic without X can be fully characterized by strong and weak bisimulations respectively over arbitrary CTMDPs. © 2014 Springer-Verlag Berlin Heidelberg.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16606
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Song, Lei ,Zhang, Lijun ,Godskesen, Jens Chr. . Bisimulations and logical characterizations on continuous-time markov decision processes[C]. 见:15th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014. San Diego, CA, United states. January 20, 2014 - January 21, 2014.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Song, Lei (1)]'s Articles
[Zhang, Lijun (2)]'s Articles
[Godskesen, Jens Chr. (3)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Song, Lei (1)]‘s Articles
[Zhang, Lijun (2)]‘s Articles
[Godskesen, Jens Chr. (3)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace