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

摩擦

書目名稱Reachability Problems影響因子(影響力)




書目名稱Reachability Problems影響因子(影響力)學(xué)科排名




書目名稱Reachability Problems網(wǎng)絡(luò)公開度




書目名稱Reachability Problems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Reachability Problems被引頻次




書目名稱Reachability Problems被引頻次學(xué)科排名




書目名稱Reachability Problems年度引用




書目名稱Reachability Problems年度引用學(xué)科排名




書目名稱Reachability Problems讀者反饋




書目名稱Reachability Problems讀者反饋學(xué)科排名

inhibit

Reachability Problems978-3-319-67089-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

REP

閃光你我

Intercept

反饋

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.

忍受

Matthew Hague,Igor PotapovIncludes supplementary material:

半球

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.

感情

Conscientious

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