找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: CONCUR 2014 – Concurrency Theory; 25th International C Paolo Baldan,Daniele Gorla Conference proceedings 2014 Springer-Verlag Berlin Heidel

[复制链接]
查看: 29071|回复: 65
发表于 2025-3-21 17:23:15 | 显示全部楼层 |阅读模式
书目名称CONCUR 2014 – Concurrency Theory
副标题25th International C
编辑Paolo Baldan,Daniele Gorla
视频videohttp://file.papertrans.cn/221/220458/220458.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: CONCUR 2014 – Concurrency Theory; 25th International C Paolo Baldan,Daniele Gorla Conference proceedings 2014 Springer-Verlag Berlin Heidel
描述This book constitutes the refereed proceedings of the 25th International Conference on Concurrency Theory, CONCUR 2014, held in Rome, Italy in September 2014. The 35 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 124 submissions. The focus of the conference is on the following topics: process calculi, model checking and abstraction, synthesis, quantitative models, automata and multithreading, complexity, process calculi and types, categories, graphs and quantum systems, automata and time, and games.
出版日期Conference proceedings 2014
关键词Markov chains; concurrent games; concurrent processes; distributed computing; model checking; probabilist
版次1
doihttps://doi.org/10.1007/978-3-662-44584-6
isbn_softcover978-3-662-44583-9
isbn_ebook978-3-662-44584-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2014
The information of publication is updating

书目名称CONCUR 2014 – Concurrency Theory影响因子(影响力)




书目名称CONCUR 2014 – Concurrency Theory影响因子(影响力)学科排名




书目名称CONCUR 2014 – Concurrency Theory网络公开度




书目名称CONCUR 2014 – Concurrency Theory网络公开度学科排名




书目名称CONCUR 2014 – Concurrency Theory被引频次




书目名称CONCUR 2014 – Concurrency Theory被引频次学科排名




书目名称CONCUR 2014 – Concurrency Theory年度引用




书目名称CONCUR 2014 – Concurrency Theory年度引用学科排名




书目名称CONCUR 2014 – Concurrency Theory读者反馈




书目名称CONCUR 2014 – Concurrency Theory读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:13:57 | 显示全部楼层
The Benefits of Sometimes Not Being Discreteblem of state space explosion, sometimes termed the .. In recent years, research has shown that there are cases in which we can reap the benefits of discrete representation during system description but then gain from more efficient analysis by approximating the discrete system by a continuous one.
发表于 2025-3-22 03:51:53 | 显示全部楼层
发表于 2025-3-22 08:03:10 | 显示全部楼层
发表于 2025-3-22 10:13:16 | 显示全部楼层
发表于 2025-3-22 15:49:14 | 显示全部楼层
发表于 2025-3-22 17:35:56 | 显示全部楼层
发表于 2025-3-23 00:44:28 | 显示全部楼层
发表于 2025-3-23 04:54:16 | 显示全部楼层
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachabili. In recent work, we introduced parametric interval counter abstraction that allowed us to verify the safety and liveness of threshold-based fault-tolerant distributed algorithms (FTDA). Due to state space explosion, applying this technique to distributed algorithms with hundreds of local states is
发表于 2025-3-23 06:17:11 | 显示全部楼层
Lost in Abstraction: Monotonicity in Multi-threaded Programsconcept is not only natural and common in multi-threaded software, but also useful: if every thread’s memory is finite, monotonicity often guarantees the decidability of safety property verification even when the number of running threads is unknown. In this paper, we show that the act of obtaining
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-11 02:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表