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

AMUSE

書目名稱Relations and Kleene Algebra in Computer Science影響因子(影響力)




書目名稱Relations and Kleene Algebra in Computer Science影響因子(影響力)學(xué)科排名




書目名稱Relations and Kleene Algebra in Computer Science網(wǎng)絡(luò)公開度




書目名稱Relations and Kleene Algebra in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Relations and Kleene Algebra in Computer Science被引頻次




書目名稱Relations and Kleene Algebra in Computer Science被引頻次學(xué)科排名




書目名稱Relations and Kleene Algebra in Computer Science年度引用




書目名稱Relations and Kleene Algebra in Computer Science年度引用學(xué)科排名




書目名稱Relations and Kleene Algebra in Computer Science讀者反饋




書目名稱Relations and Kleene Algebra in Computer Science讀者反饋學(xué)科排名

Arctic

https://doi.org/10.1007/978-3-642-04639-1algebra; algorithms; automata; combinatorial optimization; computer; computer science; formal method; optim

就職

野蠻

GROG

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.

蘑菇

漫步

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.

可卡

,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.

delusion

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.

Kindle