Titlebook: CONCUR ‘98 Concurrency Theory; 9th International Co Davide Sangiorgi,Robert Simone Conference proceedings 1998 Springer-Verlag Berlin Heide

要求

书目名称CONCUR ‘98 Concurrency Theory影响因子(影响力)




书目名称CONCUR ‘98 Concurrency Theory影响因子(影响力)学科排名




书目名称CONCUR ‘98 Concurrency Theory网络公开度




书目名称CONCUR ‘98 Concurrency Theory网络公开度学科排名




书目名称CONCUR ‘98 Concurrency Theory被引频次




书目名称CONCUR ‘98 Concurrency Theory被引频次学科排名




书目名称CONCUR ‘98 Concurrency Theory年度引用




书目名称CONCUR ‘98 Concurrency Theory年度引用学科排名




书目名称CONCUR ‘98 Concurrency Theory读者反馈




书目名称CONCUR ‘98 Concurrency Theory读者反馈学科排名

NUL

少量

Polydipsia

The regular viewpoint on PA-processes,ain result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built effectively in polynomial-time. This has many immediate applications to verification p

Debrief

窝转脊椎动物

窝转脊椎动物

Supplement

,From higher-order π-calculus to π-calculus in the presence of static operators,n particular we have found the dynamic restriction operator of CHOCS, here called blocking, useful. We investigate the consequences of adding static operators such as blocking to the first-and higher-order π-calculus. In the presence of the blocking operator (and static operators in general) the hig

BULLY

Minimality and separation results on asynchronous mobile processes,combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing [23] and input guarded summations [26]. The present paper shows that each

deceive

Abstract games for infinite state processes,d on-the-fly exploration. We describe a generic algorithm which, when instantiated with certain functions specific to the concrete game, computes a winning strategy. We apply this technique to bisimulation and model-checking of value-passing processes, and to timed automata.