S. Almagor & O. Kupferman (2011):
Max and sum Semantics for alternating weighted automata.
In: T. Bultan & P. Hsiung: Automated Technology for Verification and Analysis.
Springer,
pp. 13–27,
doi:10.1007/978-3-642-24372-1_2.
A. K. Chandra, D. C. Kozen & L. J. Stockmeyer (1981):
Alternation.
J. ACM 28(1),
pp. 114–133,
doi:10.1145/322234.322243.
K. Chatterjee, L. Doyen & T. A. Henzinger (2008):
Quantitative languages.
In: M. Kaminski & S. Martini: Computer Science Logic.
Springer,
pp. 385–400,
doi:10.1007/978-3-540-87531-4_28.
K. Chatterjee, L. Doyen & T. A. Henzinger (2009):
Alternating Weighted Automata.
In: M. Kutyłowski, W. Charatonik & M. Gębala: Fundamentals of Computation Theory.
Springer,
pp. 3–13,
doi:10.1007/978-3-642-03409-1_2.
G. De Giacomo & M. Y. Vardi (2013):
Linear temporal logic and linear dynamic logic on finite traces.
In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence.
AAAI Press,
pp. 854–860,
doi:10.5555/2540128.2540252.
Available at http://dl.acm.org/citation.cfm?id=2540128.2540252.
M. Droste & S. Dück (2015):
Weighted automata and logics on graphs.
In: G. F. Italiano, G. Pighizzini & D. T. Sannella: Mathematical Foundations of Computer Science 2015.
Springer,
pp. 192–204,
doi:10.1007/978-3-662-48057-1_15.
M. Droste & P. Gastin (2009):
Weighted Automata and Weighted Logics, chapter 5 1.
In: Droste,
doi:10.1007/978-3-642-01492-5_5.
M. Droste & D. Götze (2017):
A Nivat theorem for quantitative automata on unranked trees.
In: Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday,
pp. 22–35,
doi:10.1007/978-3-319-63121-9_2.
M. Droste, W. Kuich & H. Vogler (2009):
Handbook of Weighted Automata,
1st edition 1.
Springer,
doi:10.1007/978-3-642-01492-5.
M. Droste & D. Kuske (2021):
Weighted automata,
pp. 113–150 1.
In: Pin,
doi:10.4171/Automata-1/4.