Titlebook: Reachability Problems; 6th International Wo Alain Finkel,Jérôme Leroux,Igor Potapov Conference proceedings 2012 Springer-Verlag Berlin Heid

McKinley

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




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




书目名称Reachability Problems网络公开度




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




书目名称Reachability Problems被引频次




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




书目名称Reachability Problems年度引用




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




书目名称Reachability Problems读者反馈




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

mercenary

Interim

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata,h built-in constants. This tree represents the meaning of the program up to the meaning of built-in constants. It is much easier to reason about properties of such trees than properties of interpreted programs. Moreover some interesting properties of programs are already expressible on the level of

convulsion

Decision Problems for Linear Recurrence Sequences,ing certain fundamental . for linear recurrence sequences, namely the Skolem Problem (does the sequence have a zero?), the Positivity Problem (is the sequence always positive?), and the Ultimate Positivity Problem (is the sequence ultimately always positive?).

magenta

发展

On the Relationship between Reachability Problems in Timed and Counter Automata, timed automata with three or more clocks is naturally logarithmic-space interreducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmic-space equivalence of reachability in two-clock timed automata and space-bounded one-counter automata. This l

Glower

Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis,consist of a discrete control part that operates in a continuous environment and may be represented by hybrid automata. We recently proposed an open-source framework for hybrid automata analysis, called ., which exploits approximation techniques based on the theory of computable analysis. In this pa

foreign

Robustness of Time Petri Nets under Guard Enlargement,st if the set of discrete behaviors is preserved under arbitrarily small (but positive) perturbations. We tackle this problem for Time Petri Nets (TPNs for short) by considering the model of parametric guard enlargement which allows time-intervals constraining the firing of transitions in TPNs to be

责难

Efficient Probabilistic Model Checking of Systems with Ranged Probabilities,tion of the probabilities of satisfying a given property where the accuracy is characterized in terms of error bounds. We leverage affine arithmetic to propagate the first-order error terms. Higher-order error terms are bounded using interval arithmetic.

PLE

On the Length of Knot Transformations via Reidemeister Moves I and II,r words. One of such discrete representations is a Gauss code. In this paper we consider knot transformations in terms of string rewriting systems. We formulate the concept of knot transformations in the context of Gauss word rewriting and present linear lower and upper bounds on the length of knot