找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic for Concurrency and Synchronisation; Ruy J. G. B. Queiroz Book 2003 Springer Science+Business Media Dordrecht 2003 Bisimulation.comp

[复制链接]
查看: 39165|回复: 38
发表于 2025-3-21 19:46:29 | 显示全部楼层 |阅读模式
书目名称Logic for Concurrency and Synchronisation
编辑Ruy J. G. B. Queiroz
视频video
概述Includes supplementary material:
丛书名称Trends in Logic
图书封面Titlebook: Logic for Concurrency and Synchronisation;  Ruy J. G. B. Queiroz Book 2003 Springer Science+Business Media Dordrecht 2003 Bisimulation.comp
描述The study of information-based actions and processes has been a vibrant - terface between logic and computer science for several decades now. Indeed, several natural perspectives come together here. On the one hand, logical s- tems may be used to describe the dynamics of arbitrary computational p- cesses – as in the many sophisticated process logics available today. But also, key logical notions such as model checking or proof search are themselves informational processes involving agents with goals. The interplay between these descriptive and dynamic aspects shows even in our ordinary language. A word like “proof” hdenotes both a static ‘certificate’ of truth, and an activity which humans or machines engage in. Increasing our understanding of l- ics of this sort tells us something about computer science, and about cognitive actions in general. The individual chapters of this book show the state of the art in current - vestigations of process calculi such as linear logic, and – with mainly two major paradigms at work, namely, linear logic and modal logic. These techniques are applied to the title themes of concurrency and synchronisation, but there are also many repercussions for t
出版日期Book 2003
关键词Bisimulation; computer; logic; mathematical logic; modal logic; model theory; proof theory
版次1
doihttps://doi.org/10.1007/0-306-48088-3
isbn_softcover978-94-017-4000-5
isbn_ebook978-0-306-48088-1Series ISSN 1572-6126 Series E-ISSN 2212-7313
issn_series 1572-6126
copyrightSpringer Science+Business Media Dordrecht 2003
The information of publication is updating

书目名称Logic for Concurrency and Synchronisation影响因子(影响力)




书目名称Logic for Concurrency and Synchronisation影响因子(影响力)学科排名




书目名称Logic for Concurrency and Synchronisation网络公开度




书目名称Logic for Concurrency and Synchronisation网络公开度学科排名




书目名称Logic for Concurrency and Synchronisation被引频次




书目名称Logic for Concurrency and Synchronisation被引频次学科排名




书目名称Logic for Concurrency and Synchronisation年度引用




书目名称Logic for Concurrency and Synchronisation年度引用学科排名




书目名称Logic for Concurrency and Synchronisation读者反馈




书目名称Logic for Concurrency and Synchronisation读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:34:25 | 显示全部楼层
Chu’s Construction: A Proof-Theoretic Approachor from the free *-autonomous category . on a set of atoms . to ., where . is the free monoidal closed category with products and coproducts on the set of atoms . (a pair . in . for each atom . of .).
发表于 2025-3-22 01:09:41 | 显示全部楼层
A Tutorial Introduction to Symbolic Model Checking transition graph. Temporal logic model checking, including the specification language CTL (Computation Tree Logic), a less powerful verification technique, is then defined. Symbolic model checking itself is then defined. Throughout this tutorial, we use as a running example the alternate bit protocol to illustrate the different concepts.
发表于 2025-3-22 07:58:22 | 显示全部楼层
Modal Logics for Finite Graphs properties that a graph is Eulerian or Hamiltonian. Finally, we present an axiomatization for colouring and prove that it is sound and complete with respect to the class of finite . graphs. One of most interesting feature of this approach is the use of the axioms of Dynamic Logic together with the Löb axiom to ensure acyclicity.
发表于 2025-3-22 11:11:07 | 显示全部楼层
1572-6126 r science for several decades now. Indeed, several natural perspectives come together here. On the one hand, logical s- tems may be used to describe the dynamics of arbitrary computational p- cesses – as in the many sophisticated process logics available today. But also, key logical notions such as
发表于 2025-3-22 15:07:01 | 显示全部楼层
Bisimulation and Language Equivalenceimulation equivalence. Bisimulation equivalence is definable as a “simple” formula in first-order logic with fixed points. We show that language equivalence is not definable as an unconditional projection of simple least fixed point.
发表于 2025-3-22 19:59:13 | 显示全部楼层
Two Paradigms of Logical Computation in Affine Logic?use of the mix-rule is related to the non-determinism of classical proof-theory. The question arises, whether these features of classical cut-elimination are really irreducible to the familiar paradigm of cut-elimination for intuitionistic and linear logic.
发表于 2025-3-22 23:30:07 | 显示全部楼层
Ruy J. G. B. QueirozIncludes supplementary material:
发表于 2025-3-23 01:50:08 | 显示全部楼层
Trends in Logichttp://image.papertrans.cn/l/image/588005.jpg
发表于 2025-3-23 07:15:12 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 11:41
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表