找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Relational and Algebraic Methods in Computer Science; 13th International C Wolfram Kahl,Timothy G. Griffin Conference proceedings 2012 Spri

[复制链接]
楼主: 柳条筐
发表于 2025-3-28 16:42:54 | 显示全部楼层
发表于 2025-3-28 21:11:34 | 显示全部楼层
Two Observations in Dioid Based Model Refinement, and second, the compatibility of linear fixpoint equations with bisimulations. These equations can be used in an algebraic setting for a certain class of optimality problems. Since bisimulations can simplify the complexity of models, they can also reduce the complexity of certain optimality problems.
发表于 2025-3-29 01:48:57 | 显示全部楼层
Relation Algebras, Matrices, and Multi-valued Decision Diagramsecond, we want to outline an implementation of matrix algebras using reduced ordered multi-valued decision diagrams. This implementation combines the efficiency of operations based on those data structures with the general matrix approach to arbitrary relation algebras.
发表于 2025-3-29 06:30:07 | 显示全部楼层
Relational Concepts in Social Choicegebraic mathematics available as a tool for the study of social choice. Thus, we provide simplification, additional systematics, more compact relation-algebraic proofs and also an access to solving such problems with programs in the language . — at least for the medium sized cases.
发表于 2025-3-29 10:22:16 | 显示全部楼层
Unifying Lazy and Strict Computationsthe binary operation known from omega algebra, and derive properties of this new operation which hold for both strict and non-strict computations. All algebraic results are verified in Isabelle using its integrated automated theorem provers.
发表于 2025-3-29 12:22:51 | 显示全部楼层
Towards an Algebra for Real-Time Programsg limits, which allows the possible piecewise continuity of a variable at the boundaries of an interval to be handled in a natural manner. What sort of an algebra does this model give rise to? In this paper, we take a step towards answering that question by investigating an algebra of interval predicates.
发表于 2025-3-29 19:04:31 | 显示全部楼层
Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariantsts can be used to narrow the non-deterministic execution of relational specifications, making it viable for a relevant class of problems. In particular, we show how the proposed techniques can be applied to execute specifications of bidirectional transformations, a domain where partiality and non-determinism are paramount.
发表于 2025-3-29 20:57:39 | 显示全部楼层
发表于 2025-3-30 01:32:39 | 显示全部楼层
发表于 2025-3-30 07:40:46 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-2 21:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表