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影響因子(影響力)學(xué)科排名




書目名稱CONCUR ‘98 Concurrency Theory網(wǎng)絡(luò)公開度




書目名稱CONCUR ‘98 Concurrency Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱CONCUR ‘98 Concurrency Theory被引頻次




書目名稱CONCUR ‘98 Concurrency Theory被引頻次學(xué)科排名




書目名稱CONCUR ‘98 Concurrency Theory年度引用




書目名稱CONCUR ‘98 Concurrency Theory年度引用學(xué)科排名




書目名稱CONCUR ‘98 Concurrency Theory讀者反饋




書目名稱CONCUR ‘98 Concurrency Theory讀者反饋學(xué)科排名

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

窩轉(zhuǎn)脊椎動(dòng)物

窩轉(zhuǎn)脊椎動(dòng)物

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.