septicemia
发表于 2025-3-26 22:50:26
http://reply.papertrans.cn/23/2205/220456/220456_31.png
calorie
发表于 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.
COLON
发表于 2025-3-27 08:16:03
http://reply.papertrans.cn/23/2205/220456/220456_33.png
责任
发表于 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
CLOUT
发表于 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.
Latency
发表于 2025-3-27 21:12:48
http://reply.papertrans.cn/23/2205/220456/220456_36.png
FLORA
发表于 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.
TSH582
发表于 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.
Indict
发表于 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
急性
发表于 2025-3-28 13:55:43
http://reply.papertrans.cn/23/2205/220456/220456_40.png