Satisfaction probabilities for homogeneous stochastic MAS under cLTL admit DFA-based tensor decomposition, enabling a dual-tree value iteration framework that reduces redundant dynamic programming computations.
By Lemma 1 and Proposition 1, we have Px0 M×C dec π |=µ ≥P x0 M×Cπ(∃t≤T:l [0,t] ∈ W) =V T q (x) = X z:LQ(z)=¯q0 Y i∈I vi(z)(xi 0) = X z:LQ(z)=¯q0 Y i∈I W(R(z, i))(x i 0)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Compressing Correct-by-Design Synthesis for Stochastic Homogeneous Multi-Agent Systems with Counting LTL
Satisfaction probabilities for homogeneous stochastic MAS under cLTL admit DFA-based tensor decomposition, enabling a dual-tree value iteration framework that reduces redundant dynamic programming computations.