首页> 外文会议>Australasian symposium on Theory of computing >The relative completeness of a version of CTL

【24h】

The relative completeness of a version of CTL

机译：CTL版本的相对完整性

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

We show the relative completeness of a version of CTL* over possibly infinite states. It is based on a fair discrete system, which is with strong and weak fairness. Validity of a CTL* formula is reduced to the validity of an assertion by eliminating the temporal operators and path quantifiers inductively. The idea is to represent the predicate describing that "a fair path begins with the current state" in the underlying assertion language using fixpoint operators.

机译：我们展示了CTL版本的相对完整性*可能是无限状态。它基于一个公平的离散系统，这具有强大而弱的公平性。 CTL *公式的有效性通过无电视函数和路径量子来减少到断言的有效性。该想法是表示使用Fixpoint运算符中的基础断言语言中的“公平路径以当前状态开始的谓词”。

著录项

来源
《Australasian symposium on Theory of computing 》|2005年||共5页
会议地点
作者
Hidetomo Machi; Kohji Tomita; Chiharu Hosono;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类理论、方法 ;
关键词

相似文献

外文文献
中文文献
专利

1. Relative pelvic version: an individualized pelvic incidence-based proportional parameter that quantifies pelvic version more precisely than pelvic tilt [J] . Caglar Yilgor, Yasemin Yavuz, Nuray Sogunmez, The spine journal: official journal of the North American Spine Society . 2018 ,第10期

机译：相对骨盆版本：基于个性化的盆腔发射的比例参数，比骨盆倾斜更精确地量化骨盆版本
2. Investigation of PR and TMI Version 6 and Version 7 Rainfall Algorithms in Landfalling Tropical Cyclones Relative to the NEXRAD Stage-IV Multisensor Precipitation Estimate Dataset [J] . Joseph P. Zagrodnik, Haiyan Jiang Journal of Applied Meteorology and Climatology . 2013 ,第12期

机译：与NEXRAD IV级多传感器降水估计数据集相关的登陆热带气旋PR和TMI版本6和版本7降雨算法的研究
3. Relative efficiency and validity properties of a visual analogue vs a categorical scaled version of the Western Ontario and McMaster Universities Osteoarthritis (WOMAC) Index: Spanish versions. [J] . Villanueva I, del Mar Guzman M, Javier Toyos F, Osteoarthritis and cartilage . 2004 ,第3期

机译：视觉类比与分类分级版的西安大略省和麦克马斯特大学骨关节炎（WOMAC）的相对效率和有效性属性：西班牙语版。
4. The relative completeness of a version of CTL [C] . Hidetomo Machi, Kohji Tomita, Chiharu Hosono Australasian symposium on Theory of computing . 2005

机译：CTL版本的相对完整性
5. A relative version of the finiteness obstruction theory of Wall. [D] . Davis, Anna Alexis. 2002

机译：Wall有限障碍理论的相对版本。
6. Preferential CTL targeting of Gag is associated with relative viral control in long-term surviving HIV-1 infected former plasma donors from China [O] . Mingming Jia, Kunxue Hong, Jianping Chen, 2012

机译：在中国长期存活的被HIV-1感染的前血浆供者中对Gag的首选CTL靶向与相对病毒控制有关
7. Certain Simple, Unsolvable Problems of Group Theory. V 29,3029Parts I, II, III and IV have appeared in Series A, 57, Nos. 3 and 5; 58, Nos. 2 and 5 of these Proceedings, as well as Indag. Math., 16, Nos. 3 and 5 (1954); 17, Nos. 2 and 5 (1955).In Part I, page 234, the ninth and tenth lines following the displayed material, for both occurrences of A read D and for both occurrences of B read E: In part II, page 497, for all occurrences of M in Diagrams A and D read C. In Part IV, page 574, the third displayed line, for zαiLread z―αiL. 19).30The proof of the unsolvability of the word problem contained in this and subsequent paper is not contained in the dissertation Several simple unsolvable problems of group theory related to the word problem. (See footnote 1 of Part I.) Our proof was finally completed during the period 1954-56 while in residence at the Institute for Advanced Study. We were supported in 1954-55 directly by the Institute and in 1955-56 by National Science Foundation contract G-1974. Certain improvements were evolved ans preparations for publication were completed while the author held a Fulbright grant to the University of Oslo.Our thanks are due to Professor Kurt Gödel for his kind encouragement in these matter; certain related problems for study he has suggested we hope to deal with later. When an earlier version of Lemmas 30 and 31 was explained at a colloquium at the University of Michigan, August 3, 1956, Professor Roger Lyndon suggested an improvement which is incorporated in our present version. We are indeed indebted to Dr. John Addison and Dr. Michael Rabin for checking many of the new details during July of 1956.) [O] . Boone William W. 1957

机译：群体理论的某些简单，不可解决的问题。 V 29,3029 I，II，III和IV部分出现在A系列57、3和5号中； 58，第2和5号程序，以及Indag。 Math。，16，Nos 3 and 5（1954）; 》，第17卷，第2期和第5期（1955年）。在第一部分，第234页中，显示的材料之后的第九行和第十行，出现A读D和出现B都读E：在第二部分，第497页，对于图A和D中所有出现的M，请读C。在第Ⅳ部分，第574页中，第三行显示为zαiLreadz-αiL。 19）.30本论文及后续论文中所包含的单词问题的不可解性的证明不包含在本文中。（请参阅第I部分的脚注1。）我们的证明终于在1954-56年期间居住在高级研究所期间完成了。该研究所在1954-55年间直接为我们提供了支持，在1955-56年间得到了美国国家科学基金会的G-1974合同的支持。在作者获得奥斯陆大学富布赖特奖学金的同时，对出版物的改进和准备工作也有所进展。感谢库尔特·哥德尔教授在此方面的大力鼓励。他建议我们研究一些相关的问题，希望以后再解决。 1956年8月3日，在密歇根大学的一个座谈会上解释了Lemmas 30和31的早期版本时，Roger Lyndon教授建议进行改进，并将其纳入当前版本。我们确实要感谢John Addison博士和Michael Rabin博士在1956年7月检查了许多新细节。）

The relative completeness of a version of CTL

摘要

著录项

相似文献

相关主题

期刊订阅