首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Probabilistic transitions for P systems
作者姓名:Gabriel Ciobanu  Laura Corn?cel
作者单位:(1. “A.I.Cuza” University, Faculty of Computer Science, Blvd. Carol I No.11, 700506 Ias,i, Romania; 2. Romanian Academy, Institute of Computer Science, Blvd. Carol I No.8, 700505 Ias,i, Romania
基金项目:Supported by the Research Grant CEEX 47/2005
摘    要:In this paper we use the abstract syntax and the structural operational semantics of the P systems given in [1], and add probabilities to the rules and to the communication targets. We take into account the number of possible combinations of rules which can be applied in a computation step, as well as the consumption degree of the current resources.


Probabilistic transitions for P systems
Authors:Gabriel Ciobanu  Laura Corn?cel
Abstract:In this paper we use the abstract syntax and the structural operational semantics of the P systems given in 1 ], and add probabilities to the rules and to the communication targets. We take into account the number of possible combinations of rules which can be applied in a computation step, as well as the consumption degree of the current resources.
Keywords:probabilistic transition  P systems
本文献已被 CNKI 等数据库收录!
点击此处可从《自然科学进展》浏览原始摘要信息
点击此处可从《自然科学进展》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号