找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reachability Problems; 9th International Wo Mikolai Bojanczyk,Slawomir Lasota,Igor Potapov Conference proceedings 2015 Springer Internation

[复制链接]
查看: 7469|回复: 59
发表于 2025-3-21 16:31:34 | 显示全部楼层 |阅读模式
书目名称Reachability Problems
副标题9th International Wo
编辑Mikolai Bojanczyk,Slawomir Lasota,Igor Potapov
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Reachability Problems; 9th International Wo Mikolai Bojanczyk,Slawomir Lasota,Igor Potapov Conference proceedings 2015 Springer Internation
描述.This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 submissions. The papers cover a range of topics inthe field of reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems;frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms..
出版日期Conference proceedings 2015
关键词Algebraic Structures; Automata Theory; Cellular Automata; Communicating Automata; Computability and Deci
版次1
doihttps://doi.org/10.1007/978-3-319-24537-9
isbn_softcover978-3-319-24536-2
isbn_ebook978-3-319-24537-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing Switzerland 2015
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

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:30:41 | 显示全部楼层
Synthesis Problems for One-Counter Automata, for the parameters such that all computations from the initial configuration satisfy the formula. We show that LTL synthesis is decidable by translating it to a formula of a decidable fragment of Presburger arithmetic with divisibility.
发表于 2025-3-22 02:25:48 | 显示全部楼层
On Boundedness Problems for Pushdown Vector Addition Systems,tions are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimensional systems. The proof is via a small witness property derived from an analysis of derivation trees of grammar-controlled vector addition systems.
发表于 2025-3-22 05:21:13 | 显示全部楼层
发表于 2025-3-22 10:59:06 | 显示全部楼层
发表于 2025-3-22 16:58:44 | 显示全部楼层
发表于 2025-3-22 20:18:22 | 显示全部楼层
发表于 2025-3-22 21:44:14 | 显示全部楼层
发表于 2025-3-23 02:58:30 | 显示全部楼层
0302-9743 tiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms..978-3-319-24536-2978-3-319-24537-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-23 05:51:00 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-13 08:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表