找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reachability Problems; 11th International W Matthew Hague,Igor Potapov Conference proceedings 2017 Springer International Publishing AG 201

[复制链接]
查看: 54782|回复: 51
发表于 2025-3-21 17:48:57 | 显示全部楼层 |阅读模式
书目名称Reachability Problems
副标题11th International W
编辑Matthew Hague,Igor Potapov
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Reachability Problems; 11th International W Matthew Hague,Igor Potapov Conference proceedings 2017 Springer International Publishing AG 201
描述This book constitutes the refereed proceedings of the 11th InternationalWorkshop on Reachability Problems, RP 2017, held in London, UK,in September 2017. The 12 full papers presented together with 1 invitedpaper were carefully reviewed andselected from 17 submissions..The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining .mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 2017
关键词semantics; software engineering; model checking; automata theory; timed automata; translation (languages)
版次1
doihttps://doi.org/10.1007/978-3-319-67089-8
isbn_softcover978-3-319-67088-1
isbn_ebook978-3-319-67089-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing AG 2017
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

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:18:45 | 显示全部楼层
Reachability Problems978-3-319-67089-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 02:07:26 | 显示全部楼层
发表于 2025-3-22 08:07:55 | 显示全部楼层
发表于 2025-3-22 10:36:34 | 显示全部楼层
发表于 2025-3-22 14:46:39 | 显示全部楼层
The Multiple Dimensions of Mean-Payoff Games,. We consider quantitative game models for the design of reactive systems working in resource-constrained environment. The game is played on a finite weighted graph where some resource (e.g., battery) can be consumed or recharged along the edges of the graph.
发表于 2025-3-22 19:25:47 | 显示全部楼层
Matthew Hague,Igor PotapovIncludes supplementary material:
发表于 2025-3-23 00:54:17 | 显示全部楼层
Adding Dense-Timed Stack to Integer Reset Timed Automata,. We prove the closure properties of . under union, intersection, complementation, and determinization. Further, we show that reachability of . is .-complete, i.e. the complexity is no more than that of timed automata.
发表于 2025-3-23 02:13:06 | 显示全部楼层
发表于 2025-3-23 07:14:48 | 显示全部楼层
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions,ng reductions, known as “short reductions,” which preserve the polynomial-time sub-linear-space complexity. As variants of ., we consider the breadth-first search problem, the minimal path problem, and the topological sorting problem. Certain restricted forms of them fall into .. We also consider a
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-14 10:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表