Titlebook: Automata, Languages and Programming; 36th International C Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga Conference proceedings 2009 Sp

CK828

书目名称Automata, Languages and Programming影响因子(影响力)




书目名称Automata, Languages and Programming影响因子(影响力)学科排名




书目名称Automata, Languages and Programming网络公开度




书目名称Automata, Languages and Programming网络公开度学科排名




书目名称Automata, Languages and Programming被引频次




书目名称Automata, Languages and Programming被引频次学科排名




书目名称Automata, Languages and Programming年度引用




书目名称Automata, Languages and Programming年度引用学科排名




书目名称Automata, Languages and Programming读者反馈




书目名称Automata, Languages and Programming读者反馈学科排名

高尔夫

patriarch

Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Typesystem that, given a process ., tries to extract a spatial-behavioural type ., in the form of a . term that is logically equivalent to the given process. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiabili

Daily-Value

When Are Timed Automata Determinizable?rove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical . timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer

overbearing

Faithful Loops for Aperiodic E-Ordered Monoidstheorem [10]. This theorem states that there exists a bijection between varieties of regular languages and varieties of finite monoids. For example, the variety of star-free regular languages (the closure of finite languages under Boolean operations and concatenation) is related to the monoid variet

ureter

Semilinear Program Feasibilityalgebraic structure . where . are the real numbers and ..,..,... is an enumeration of all linear relations with rational coefficients, we prove that a semilinear relation . (i.e., a relation that is first-order definable with linear inequalities) either has a quantifier-free Horn definition in . or

POWER

Floats and Ropes: A Case Study for Formal Numerical Program Verificationunding the rounding error was tricky as the usual idea, that is to bound the absolute value of the error at each step, fails. Our idea is to find out a precise analytical expression that cancels with itself at the next step, and to formally prove the correctness of this approach.

Robust

Reachability in Stochastic Timed Games a natural way continuous-time Markov decision processes. We focus on the reachability problem for these games, and ask whether one of the players has a strategy to ensure that the probability of reaching a fixed set of states is equal to (or below, resp. above) a certain number ., whatever the seco

滔滔不绝地讲

作呕