找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reachability Problems; 5th International Wo Giorgio Delzanno,Igor Potapov Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelber

[复制链接]
查看: 48100|回复: 66
发表于 2025-3-21 16:30:03 | 显示全部楼层 |阅读模式
书目名称Reachability Problems
副标题5th International Wo
编辑Giorgio Delzanno,Igor Potapov
视频video
概述Up-to-date results.Fast-track conference proceedings.State-of-the-art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Reachability Problems; 5th International Wo Giorgio Delzanno,Igor Potapov Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelber
描述This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games.
出版日期Conference proceedings 2011
关键词algorithms; cellular automata; computational complexity; real-time systems; timed automata; algorithm ana
版次1
doihttps://doi.org/10.1007/978-3-642-24288-5
isbn_softcover978-3-642-24287-8
isbn_ebook978-3-642-24288-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag GmbH Berlin Heidelberg 2011
The information of publication is updating

书目名称Reachability Problems影响因子(影响力)




书目名称Reachability Problems影响因子(影响力)学科排名




书目名称Reachability Problems网络公开度




书目名称Reachability Problems网络公开度学科排名




书目名称Reachability Problems被引频次




书目名称Reachability Problems被引频次学科排名




书目名称Reachability Problems年度引用




书目名称Reachability Problems年度引用学科排名




书目名称Reachability Problems读者反馈




书目名称Reachability Problems读者反馈学科排名




单选投票, 共有 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-21 20:19:46 | 显示全部楼层
Observing Continuous-Time MDPs by 1-Clock Timed Automata,cifications. The central issue is to compute the maximum probability of the set of timed paths of a CTMDP . that are accepted by a DTA .. We show that this problem can be reduced to a linear programming problem whose coefficients are maximum timed reachability probabilities in a set of CTMDPs, which
发表于 2025-3-22 02:46:24 | 显示全部楼层
发表于 2025-3-22 06:45:06 | 显示全部楼层
发表于 2025-3-22 12:26:47 | 显示全部楼层
发表于 2025-3-22 14:05:15 | 显示全部楼层
发表于 2025-3-22 19:13:57 | 显示全部楼层
发表于 2025-3-23 00:44:57 | 显示全部楼层
发表于 2025-3-23 04:51:21 | 显示全部楼层
发表于 2025-3-23 07:50:54 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-4 13:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表