找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Concurrency: Theory, Language, and Architecture; UK/Japan Workshop, O Akinori Yonezawa,Takayasu Ito Conference proceedings 1991 Springer-Ve

[复制链接]
楼主: 新石器时代
发表于 2025-3-23 12:34:41 | 显示全部楼层
Concurrency: Theory, Language, and Architecture978-3-540-46452-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-23 14:33:31 | 显示全部楼层
发表于 2025-3-23 20:54:43 | 显示全部楼层
https://doi.org/10.1007/b138484es a backward chaining theorem prover for constructing a design from a requirement, and an execution mechanism for constructing a model of the design such that the model can be checked to satisfy the requirement at each point. A brief overview of executable temporal logic is presented together with
发表于 2025-3-23 23:58:25 | 显示全部楼层
Keyao Zhu,Hongyue Zhu,Biswanath Mukherjeeo express that the success of execution of . produces the success of execution of .. We assume that an execution of a statement will fall into one of success,failure and pending. We consider a set of executional operators: [;] (sequential execution), [+] (disjunctive execution), [V] (execution by no
发表于 2025-3-24 04:42:51 | 显示全部楼层
发表于 2025-3-24 08:50:52 | 显示全部楼层
发表于 2025-3-24 12:34:33 | 显示全部楼层
发表于 2025-3-24 16:31:04 | 显示全部楼层
Keyao Zhu,Hongyue Zhu,Biswanath Mukherjeelel language to which module facility is added through the object-oriented style. Fleng−− is a low level language used for the explicit control of execution. Fleng is the core language for this language set, on which Fleng++ and Fleng−− are based. Control features for parallel machine such as proces
发表于 2025-3-24 20:58:11 | 显示全部楼层
Keyao Zhu,Hongyue Zhu,Biswanath Mukherjeelog and AND-parallel computation of committed choice logic programming languages such as PARLOG, Concurrent Prolog and Guarded Horn Clauses..Starting from a naive semantics suitable for simulation in sequential machines, we develop a new semantics with fine grain parallelism. The semantics is based
发表于 2025-3-24 23:40:15 | 显示全部楼层
Keyao Zhu,Hongyue Zhu,Biswanath Mukherjee. Evaluation of a future expression requires spawning a subprocess. For relatively fine-grained parallel applications, the time for process creation affects the overall performance of the program. In this paper, we propose another interpretation of the future construct, called the ., which is useful
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-2 05:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表