Titlebook: Reachability Problems; 8th International Wo Joël Ouaknine,Igor Potapov,James Worrell Conference proceedings 2014 Springer International Pub

游牧

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




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




书目名称Reachability Problems网络公开度




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




书目名称Reachability Problems被引频次




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




书目名称Reachability Problems年度引用




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




书目名称Reachability Problems读者反馈




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

使成核

Regular Strategies in Pushdown Reachability Games,proach that builds upon the popular saturation technique. Saturation for analysing pushdown systems has been successfully implemented by Moped and WALi. Thus, our approach has the potential for practical applications to controller-synthesis problems.

送秋波

Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations,ness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.

虚弱

insipid

消散

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions,lities, we adapt the game-based abstraction refinement method. In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations represented as a set of symbolic constraints between parameters.

paradigm

性上瘾

0302-9743 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and co

咽下

Integer Vector Addition Systems with States,Most interestingly, it turns out that while the addition of reset operations to ordinary VASS leads to undecidability and Ackermann-hardness of reachability and coverability, respectively, they can be added to ℤ-VASS while retaining .-completeness of both coverability and reachability.

笨拙的我

Mean-Payoff Games with Partial-Observation,le-forming game. This yields several decidable classes of mean-payoff games of asymmetric information that require only finite-memory strategies, including a generalization of perfect information games where positional strategies are sufficient. We give an exponential time algorithm for determining the winner of the latter.