DECIDABILITY

作品数：8被引量：7H指数：1
导出分析报告
相关领域：自动化与计算机技术更多>>
相关作者：殷建平张波云蒿敬波更多>>
相关机构：国防科学技术大学更多>>
相关期刊：《Science China(Information Sciences)》《Journal of Computer Science & Technology》《Science China Mathematics》《Frontiers of Computer Science》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Decidability of linearizabilities for relaxed data structures
《Science China(Information Sciences)》2018年第1期109-118,共10页Chao WANG Yi LV Peng WU 
supported by National Natural Science Foundation of China (Grants Nos. 61672504, 60721061, 60833001, 61572478, 61672503, 61100069, 61161130530);National Basic Research Program of China (973 Program) (Grant No. 2014CB340700)
Many recent implementations of concurrent data structures relaxed their linearizability requirements for better performance and scalability. Quasi-linearizability, k-linearizability and regular-relaxed linearizability...
关键词：concurrent data structures quantitative relaxation LINEARIZABILITY DECIDABILITY finite automata 
Decidable subsets of open logic and an algorithm for R-calculus被引量：1
《Science China(Information Sciences)》2015年第1期70-80,共11页ZHANG Wei 
supported by State Key Laboratory of Software Development Environment Open Fund (Grant No. SKLSDE-2012KF-02);Key Construction Program of the National 985 Project (Grant No. 26311005)
Open logic is an attractive logic theory that can describe the growth and evolution of knowledge.However, related studies show that open logic is undecidable in first-order logic and thus is hard to be programmed. Thi...
关键词：open logic DECIDABILITY maximal contraction R-calculus mechanical theorem proving 
Self-similar fractals: An algorithmic point of view
《Science China Mathematics》2014年第4期755-766,共12页WANG Qin XI LiFeng ZHANG Kai 
supported by National Natural Science Foundation of China(Grants Nos.11071224 and 11371329);Program for New Century Excellent Talents in University;Natural Science Foundation of Zhejiang Province(Grants Nos.LY12F02011 and LR13A1010001);Foundation of Zhejiang Educational Committee(Grant No.Y201226044)
This paper studies the self-similar fractals with overlaps from an algorithmic point of view.A decidable problem is a question such that there is an algorithm to answer"yes"or"no"to the question for every possible inp...
关键词：FRACTAL DECIDABILITY DIMENSION separation condition 
A survey on temporal logics for specifying and verifying real-time systems被引量：5
《Frontiers of Computer Science》2013年第3期370-403,共34页Savas KONUR 
Over the last two decades, there has been an extensive study of logical formalisms on specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although...
关键词：propositional temporal logics first-order linear temporal logics branching temporal logics interval temporal logics real-time temporal logics probabilistic temporal logics DECIDABILITY model checking EXPRESSIVENESS 
On the decidability of open logic被引量：1
《Science in China(Series F)》2009年第8期1283-1291,共9页ZHANG Wei 
Open logic （OL） is a noticeable logic theory dealing with the description of knowledge growth and updating, as well as the evolution of hypothesis. Up to now, however, many problems related to the proof theoretical ...
关键词：open logic epistemic process DECIDABILITY 
On decidability and model checking for a first order modal logic for value-passing processes
《Science in China(Series F)》2003年第1期45-59,共15页薛锐 林惠民 
This work was partially supported by the National Natural Science Foundationof China (Grant No. 69833020); the National High Technology Development Program of China (Grant No. 2002AA144050);the National Grand Fundamental Research 973 Program of China
A semantic interpretation of a first order extension of Hennessy-Milner logic for value-passing processes, named HML(FO), is presented. The semantics is based on symbolic transition graphs with assignment. It is shown...
关键词：first order modal logic DECIDABILITY model checking value-passing processes. 
Decidability of Mean Value Calculus
《Journal of Computer Science & Technology》1999年第2期173-180,共8页李晓山 
Mean Value Calculus ( MVC) is a real-time logic which can be used to specify and verify real-time systems . As a conservative extension of Duration Calculus (DC) , MVC increases the expressive power but keeps the prop...
关键词：mean value calculus real-time systems DECIDABILITY 
DECIDABILITY OF FINITE FORCING COMPANION
《Chinese Science Bulletin》1990年第15期1315-1315,共1页沈恩绍 
It is well known that the finite forcing companion Tf is, in general, hyperarithmetic over T? . We obtain Tf is T?-decidable if it ∑1T?. Th...
关键词：mathematics PRIMITIVE FORCING showing quant INFINITELY RECURSIVE 切一 树行 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部