Home > Papers

 
 
Possibilistic Kripke Structure Decision Processes
XUE Yan 1,LEI Hongxuan 2,LI Yongming 2 *
1.College of Computer Science,Shaanxi Normal University, Xi’an 710062
2.College of Computer Science,Shaanxi Normal University,Xi’an 710062
*Correspondence author
#Submitted by
Subject:
Funding: NSFC（No.No. 60873119）, the Higher School Doctoral Subject Foundation of Ministry of Education of China（No.No.200807180005）
Opened online:22 December 2011
Accepted by: none
Citation: XUE Yan,LEI Hongxuan,LI Yongming.Possibilistic Kripke Structure Decision Processes[OL]. [22 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4449954
 
 
We propose the concept of possibilistic Kripke structure decision process (PKSDP), PKSDP is a generalization of possibilistic Kripke structure (PKS), useful for modeling and quantifying the possible outcomes of random actions. We define the path in a PKSDP, scheduler, PKS of a PKSDP induced by a scheduler, memoryless scheduler, present the theory of reachability possibilities. We also address some examples of PKSDPs, Finally, we discuss the existence of optimal memoryless schedulers and value iteration for step-bounded reachability properties.
Keywords:possibilistic Kripke structure decision process; scheduler; value iteration; reachability possibilities
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 260
Bookmarked 0
Recommend 5
Comments Array
Submit your papers