找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: CONCUR 2012- Concurrency Theory; 23rd International C Maciej Koutny,Irek Ulidowski Conference proceedings 2012 Springer-Verlag Berlin Heide

[復制鏈接]
樓主: ODE
31#
發(fā)表于 2025-3-26 22:50:26 | 只看該作者
32#
發(fā)表于 2025-3-27 03:27:23 | 只看該作者
Reachability Problem for Weak Multi-Pushdown Automataplete. This matches the complexity of the same problem for communication-free vector addition systems (known also as commutative context-free graphs), a special case of stateless multi-pushdown automata.
33#
發(fā)表于 2025-3-27 08:16:03 | 只看該作者
34#
發(fā)表于 2025-3-27 13:30:02 | 只看該作者
0302-9743 ity analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.978-3-642-32939-5978-3-642-32940-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
35#
發(fā)表于 2025-3-27 15:50:07 | 只看該作者
https://doi.org/10.1007/978-3-658-14528-6) reachability games are undecidable for finite targets, (ii) they are 2-EXPTIME-complete for upward-closed targets and (iii) safety games are co-NP-complete for finite, upward-closed and semi-linear targets. Moreover, for the decidable cases, we build a finite representation of the corresponding controllers.
36#
發(fā)表于 2025-3-27 21:12:48 | 只看該作者
37#
發(fā)表于 2025-3-28 00:20:07 | 只看該作者
Concurrent Games on VASS with Inhibition) reachability games are undecidable for finite targets, (ii) they are 2-EXPTIME-complete for upward-closed targets and (iii) safety games are co-NP-complete for finite, upward-closed and semi-linear targets. Moreover, for the decidable cases, we build a finite representation of the corresponding controllers.
38#
發(fā)表于 2025-3-28 03:29:34 | 只看該作者
Linearizability with Ownership Transferlated to the original one by our generalisation of linearizability. We also prove that linearizability with ownership transfer can be derived from the classical one if the library does not access some of data structures transferred to it by the client.
39#
發(fā)表于 2025-3-28 10:03:14 | 只看該作者
0302-9743 he 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachabil
40#
發(fā)表于 2025-3-28 13:55:43 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-15 14:07
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
鸡东县| 延安市| 泰来县| 彰化市| 门头沟区| 伊宁市| 准格尔旗| 蒙阴县| 彰化县| 德江县| 那坡县| 新乡县| 磐安县| 白城市| 晋州市| 外汇| 兴安盟| 和静县| 冕宁县| 乌拉特中旗| 固阳县| 桃园市| 土默特左旗| 桦川县| 正安县| 麻阳| 永昌县| 法库县| 红安县| 怀柔区| 阿坝| 于都县| 阳江市| 武功县| 吉木萨尔县| 阳城县| 新沂市| 会昌县| 藁城市| 徐水县| 格尔木市|