欧美一区二区三区在观看,亚洲精品无码专区在线播放,亚洲综合伊人色一区,国产黄色在线免费观看

當(dāng)前位置: > 學(xué)術(shù)報(bào)告 > 理科 > 正文

理科

Fuzzy Alternating Refinement Relations Under the G?del Semantics

發(fā)布時(shí)間:2021-10-18 瀏覽:

報(bào)告題目:Fuzzy Alternating Refinement Relations Under the G?del Semantics

報(bào)告人: 潘海玉 桂林電子科技大學(xué)副教授

講座日期:2021-10-21

講座時(shí)間16:30

報(bào)告地點(diǎn):騰訊會(huì)議267941889

主辦單位:數(shù)學(xué)與統(tǒng)計(jì)學(xué)院

講座人簡(jiǎn)介:

潘海玉,桂林電子科技大學(xué)副教授,碩士生導(dǎo)師。2009年畢業(yè)于浙江理工大學(xué),獲得工學(xué)碩士學(xué)位;2012畢業(yè)于華東師范大學(xué),獲得博士學(xué)位;2013-2017年在陜西師范大學(xué)博士后流動(dòng)站工作。 現(xiàn)任中國(guó)計(jì)算機(jī)學(xué)會(huì)理論計(jì)算機(jī)專委會(huì)執(zhí)行委員、中國(guó)計(jì)算機(jī)學(xué)會(huì)形式化方法專委會(huì)執(zhí)行委員、中國(guó)人工智能學(xué)會(huì)離散智能計(jì)算專委會(huì)委員、中國(guó)邏輯學(xué)會(huì)非經(jīng)典邏輯與計(jì)算專委會(huì)委員和中國(guó)系統(tǒng)工程學(xué)會(huì)模糊數(shù)學(xué)與模糊系統(tǒng)專委會(huì)委員。研究方向?yàn)樾问交椒ā⒛:壿嫛X?fù)責(zé)主持國(guó)家自然科學(xué)基金面上項(xiàng)目、國(guó)家自然科學(xué)基金地區(qū)項(xiàng)目、中國(guó)博士后基金、廣西自然科學(xué)基金面上項(xiàng)目、廣西可信軟件重點(diǎn)實(shí)驗(yàn)室開放基金。以第一作者身份在IEEE Transactions on Fuzzy Systems,F(xiàn)uzzy Sets and Systems,International Journal of Approximate Reasoning,Theoretical Computer Science,F(xiàn)undamenta Informaticae等國(guó)內(nèi)外重要學(xué)術(shù)刊物和國(guó)際會(huì)議發(fā)表論文20余篇。

講座簡(jiǎn)介:

Refinement relations, such as trace containment, simulation preorder and their alternating versions, have been successfully applied in formal verification of concurrent systems. Recently, trace containment and simulation preorder have been adopted and developed in fuzzy systems, but the generalization of their alternating versions to fuzzy systems has not been investigated. To satisfy the need for modeling and analyzing fuzzy systems, this report proposes two types of refinement relations called fuzzy alternating trace containment and fuzzy alternating simulation preorder, based on fuzzy concurrent game structures (FCGSs) under theG?del semantics. These two fuzzy notions inherit properties from the corresponding classical setting. For example, fuzzy alternating simulation preorder for finite-state FCGSs can be computed in polynomial time, fuzzy alternating simulation preorder is a fuzzy subset of fuzzy alternating trace containment, and both relations can be logically characterized in terms of fuzzy version of alternating-time temporal logic. These properties make the theory developed here be suitable for the modeling and verification of fuzzy systems.