找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 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 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-15 11:53
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
万州区| 多伦县| 安图县| 五华县| 普宁市| 苍溪县| 临桂县| 潢川县| 翼城县| 乐昌市| 内丘县| 巴林左旗| 钟山县| 成武县| 瑞昌市| 吴堡县| 大足县| 娱乐| 噶尔县| 吉林省| 淮阳县| 洱源县| 涞水县| 新乐市| 普兰店市| 内乡县| 伽师县| 石台县| 瑞金市| 济南市| 绥棱县| 黔西县| 江孜县| 德保县| 南通市| 皮山县| 运城市| 阳山县| 朔州市| 泰安市| 贵定县|