Bisimulations and logical characterizations on continuous-time markov decision processes

ISCAS OpenIR

	Bisimulations and logical characterizations on continuous-time markov decision processes
	Song, Lei (1); Zhang, Lijun (2); Godskesen, Jens Chr. (3)
	2014
会议名称	15th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014
页码	98-117
会议日期	January 20, 2014 - January 21, 2014
会议地点	San Diego, CA, United states
收录类别	EI
出版地	Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
ISSN	3029743
ISBN	9783642540127
部门归属	(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
摘要	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.; 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.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16606
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Song, Lei ,Zhang, Lijun ,Godskesen, Jens Chr. . Bisimulations and logical characterizations on continuous-time markov decision processes[C]. Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany,2014:98-117.