找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Relations and Kleene Algebra in Computer Science; 11th International C Rudolf Berghammer,Ali Mohamed Jaoua,Bernhard Mölle Conference procee

[复制链接]
查看: 44809|回复: 65
发表于 2025-3-21 18:11:47 | 显示全部楼层 |阅读模式
书目名称Relations and Kleene Algebra in Computer Science
副标题11th International C
编辑Rudolf Berghammer,Ali Mohamed Jaoua,Bernhard Mölle
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Relations and Kleene Algebra in Computer Science; 11th International C Rudolf Berghammer,Ali Mohamed Jaoua,Bernhard Mölle Conference procee
描述The book constitutes the joint refereed proceedings of the 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and the 6th International Conference on Applications of Kleene Algebras, AKA 2009, held in Doha, Qatar in November 2009. The 22 revised full papers presented together with 2 invited papers were carefully reviewed and selected from numerous submissions. The papers describe the calculus of relations and similar algebraic formalisms as methodological and conceptual tools with special focus on formal methods for software engineering, logics of programs and links to neighbouring disciplines. Their scope comprises relation relation algebras and Kleene algebras, related formalisms such as process algebras, fixed point calculi, idempotent semirings, quantales, allegories, dynamic algebras, cylindric algebras and their applications in areas such as verification, analysis and development of programs and algorithms relational formal methods such as B or Z, tabular methods, algebraic approaches to logics of programs, modal and dynamic logics, interval and temporal logics, algebraic semantics of programming languages , graph theory and combinatorial o
出版日期Conference proceedings 2009
关键词algebra; algorithms; automata; combinatorial optimization; computer; computer science; formal method; optim
版次1
doihttps://doi.org/10.1007/978-3-642-04639-1
isbn_softcover978-3-642-04638-4
isbn_ebook978-3-642-04639-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

书目名称Relations and Kleene Algebra in Computer Science影响因子(影响力)




书目名称Relations and Kleene Algebra in Computer Science影响因子(影响力)学科排名




书目名称Relations and Kleene Algebra in Computer Science网络公开度




书目名称Relations and Kleene Algebra in Computer Science网络公开度学科排名




书目名称Relations and Kleene Algebra in Computer Science被引频次




书目名称Relations and Kleene Algebra in Computer Science被引频次学科排名




书目名称Relations and Kleene Algebra in Computer Science年度引用




书目名称Relations and Kleene Algebra in Computer Science年度引用学科排名




书目名称Relations and Kleene Algebra in Computer Science读者反馈




书目名称Relations and Kleene Algebra in Computer Science读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:45:06 | 显示全部楼层
https://doi.org/10.1007/978-3-642-04639-1algebra; algorithms; automata; combinatorial optimization; computer; computer science; formal method; optim
发表于 2025-3-22 02:55:03 | 显示全部楼层
发表于 2025-3-22 07:53:49 | 显示全部楼层
发表于 2025-3-22 08:52:28 | 显示全部楼层
A Model of Internet Routing Using Semi-modules, need better formal models to capture the complexities of Internet routing. In this paper we develop an algebraic model that clarifies the distinction between . and .. We hope that this suggests new approaches to the design of routing protocols.
发表于 2025-3-22 14:21:03 | 显示全部楼层
发表于 2025-3-22 18:47:01 | 显示全部楼层
General Correctness Algebra,vious approaches. In particular, we propose axioms, correctness statements, a correctness calculus, specification constructs and a loop refinement rule. The Egli-Milner order is treated algebraically and we show how to obtain least fixpoints, used to solve recursion equations, in terms of the natural order.
发表于 2025-3-23 01:14:15 | 显示全部楼层
,Armstrong’s Inference Rules in Dedekind Categories,he theory of formal concepts by Wille and Ganter. In this paper the authors treat Armstrong’s inference rules and the implication as (binary) relations in an upper semi lattice in a Dedekind category, and give a relation algebraic proof of the completeness theorem for Armstrong’s inference rules in a Schröder category.
发表于 2025-3-23 03:48:43 | 显示全部楼层
Collagories for Relational Adhesive Rewriting,n-algebraic approach to graph transformation. Collagories closely correspond to the adhesive categories important for the categorical DPO approach to graph transformation. but thanks to their relation-algebraic flavour provide a more accessible and more flexible setting.
发表于 2025-3-23 05:58:56 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-21 17:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表