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

只看該作者 · 發(fā)表于 2025-3-21 19:14:04

書目名稱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é)科排名

只看該作者 · 發(fā)表于 2025-3-22 00:09:17

只看該作者 · 發(fā)表于 2025-3-22 01:23:42

只看該作者 · 發(fā)表于 2025-3-22 08:14:49

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

只看該作者 · 發(fā)表于 2025-3-22 12:09:40

只看該作者 · 發(fā)表于 2025-3-22 13:22:53

只看該作者 · 發(fā)表于 2025-3-22 20:17:23

只看該作者 · 發(fā)表于 2025-3-23 00:05:31

,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

只看該作者 · 發(fā)表于 2025-3-23 05:21:29

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

只看該作者 · 發(fā)表于 2025-3-23 07:51:16

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.

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 06:49
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved