Scintillations
发表于 2025-3-30 09:27:23
http://reply.papertrans.cn/23/2205/220456/220456_51.png
羽毛长成
发表于 2025-3-30 14:41:37
http://reply.papertrans.cn/23/2205/220456/220456_52.png
Ischemia
发表于 2025-3-30 17:56:04
http://reply.papertrans.cn/23/2205/220456/220456_53.png
Supplement
发表于 2025-3-30 21:40:32
http://reply.papertrans.cn/23/2205/220456/220456_54.png
nonplus
发表于 2025-3-31 03:04:35
Reachability and Termination Analysis of Concurrent Quantum Programsncurrent programs. Some characterizations of the reachable space, uniformly repeatedly reachable space and termination of a concurrent quantum program are derived by the analysis of their mathematical structures. Based on these characterizations, algorithms for computing the reachable space and unif
空中
发表于 2025-3-31 07:13:28
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstractionor weighted automata asks, given two weighted automata . and ., whether for all words ., the value that . assigns to . is less than or equal to the value . assigns to .. The problem is of great practical interest, yet is known to be undecidable. Efforts to approximate weighted containment by weighte
保留
发表于 2025-3-31 10:28:35
http://reply.papertrans.cn/23/2205/220456/220456_57.png
profligate
发表于 2025-3-31 17:08:57
Strategy Synthesis for Multi-Dimensional Quantitative Objectivesrole in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express .-regular conditions. While in general, the winning strategies in s
osteoclasts
发表于 2025-3-31 21:33:18
Quantitative Languages Defined by Functional Automataghted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the la
争吵加
发表于 2025-3-31 22:47:04
A Comparison of Succinctly Represented Finite-State Systems show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.