找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 54865|回復(fù): 51
樓主
發(fā)表于 2025-3-21 17:48:57 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Reachability Problems
副標(biāo)題11th International W
編輯Matthew Hague,Igor Potapov
視頻videohttp://file.papertrans.cn/822/821829/821829.mp4
概述Includes supplementary material:
叢書(shū)名稱(chēng)Lecture Notes in Computer Science
圖書(shū)封面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
關(guān)鍵詞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

書(shū)目名稱(chēng)Reachability Problems影響因子(影響力)




書(shū)目名稱(chēng)Reachability Problems影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Reachability Problems網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Reachability Problems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Reachability Problems被引頻次




書(shū)目名稱(chēng)Reachability Problems被引頻次學(xué)科排名




書(shū)目名稱(chēng)Reachability Problems年度引用




書(shū)目名稱(chēng)Reachability Problems年度引用學(xué)科排名




書(shū)目名稱(chēng)Reachability Problems讀者反饋




書(shū)目名稱(chēng)Reachability Problems讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶(hù)組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:18:45 | 只看該作者
Reachability Problems978-3-319-67089-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
板凳
發(fā)表于 2025-3-22 02:07:26 | 只看該作者
地板
發(fā)表于 2025-3-22 08:07:55 | 只看該作者
5#
發(fā)表于 2025-3-22 10:36:34 | 只看該作者
6#
發(fā)表于 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.
7#
發(fā)表于 2025-3-22 19:25:47 | 只看該作者
Matthew Hague,Igor PotapovIncludes supplementary material:
8#
發(fā)表于 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.
9#
發(fā)表于 2025-3-23 02:13:06 | 只看該作者
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-17 04:10
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
河津市| 秦皇岛市| 正蓝旗| 泾阳县| 耿马| SHOW| 杭锦后旗| 安塞县| 丰城市| 龙泉市| 米林县| 阜平县| 潍坊市| 新兴县| 黄平县| 女性| 鸡西市| 富阳市| 长春市| 林甸县| 阜城县| 基隆市| 军事| 乌苏市| 太原市| 旬阳县| 都江堰市| 静海县| 绵竹市| 荣成市| 武川县| 嘉义市| 长丰县| 湄潭县| 巴东县| 九台市| 耒阳市| 麻江县| 淮安市| 虹口区| 万山特区|