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.
We let (z, l,˜z) be any edge created at this step, with q= LQ(˜z)and˜κ=R(˜z, i)
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.