Jiří Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius & Alexandra Silva (2012):
A Coalgebraic Perspective on Minimization and Determinization.
In: Proc. of FOSSACS '12.
Springer,
pp. 58–73,
doi:10.1007/978-3-642-28729-9_4.
LNCS/ARCoSS 7213.
Shaull Almagor, Udi Boker & Orna Kupferman (2011):
What's Decidable about Weighted Automata?.
In: Proc. of ATVA '11.
Springer,
pp. 482–491,
doi:10.1007/978-3-642-24372-1_37.
LNCS 6996.
Mariel-Pierre Béal, Slyvain Lombardy & Jacques Sakarovitch (2006):
Conjugacy and Equivalence of Weighted Automata and Functional Transducers.
In: Prof. of CSR '06.
Springer,
pp. 58–69,
doi:10.1007/11753728_9.
LNCS 3967.
Harsh Beohar, Barbara König, Sebastian Küpper & Alexandra Silva (2017):
Conditional Transition Systems with Upgrades.
In: Proc. of TASE '17 (Theoretical Aspects of Software Engineering).
To appear.
Filippo Bonchi, Barbara König & Sebastian Küpper (2017):
Up-To Techniques for Weighted Systems.
In: Proc. of TACAS '17, Part I.
Springer,
pp. 535–552,
doi:10.1007/978-3-662-54577-5_31.
LNCS 10205.
Filippo Bonchi & Damien Pous (2013):
Checking NFA equivalence with bisimulations up to congruence.
In: Proc. of POPL '13.
ACM,
pp. 457–468,
doi:10.1145/2429069.2429124.
Michele Boreale (2009):
Weighted bisimulation in linear algebraic form.
In: Proc. of CONCUR '09.
Springer,
pp. 163–177,
doi:10.1007/978-3-642-04081-8_12.
LNCS 5710.
Andreas. Classen, Maxime Cordy, Pierre-Yves Schobbens, Patrick Heymans, Axel Legay & Jean-François Raskin (2013):
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking.
IEEE Trans. Softw. Eng. 39(8),
pp. 1069–1089,
doi:10.1109/TSE.2012.86.
Maxime Cordy, Andreas Classen, Gilles Perrouin, Pierre-Yves Schobbens, Patrick Heymans & Axel Legay (2012):
Simulation-based abstractions for software product-line model checking.
In: Proc. of ICSE '12,
pp. 672–682,
doi:10.1109/ICSE.2012.6227150.
Raymond A. Cuninghame-Green (1979):
Minimax algebra.
Lecture Notes in Economics and Mathematical Systems.
Springer-Verlag,
doi:10.1007/978-3-642-48708-8.
Abhijit Das & C. E. Veni Madhavan (2009):
Public-Key Cryptography: Theory and Practice.
Pearson Education.
pp. 295-296.
Brian A. Davey & Hilary A. Priestley (2002):
Introduction to lattices and order.
Cambridge University Press,
doi:10.1017/CBO9780511809088.
Javier Esparza, Michael Luttenberger & Maximilian Schlund (2014):
FPsolve: A Generic Solver for Fixpoint Equations over Semirings.
In: Proc. of CIAA '14.
Springer,
pp. 1–15,
doi:10.1007/978-3-319-08846-4_1.
LNCS 8587.
Stefan Kiefer, Andrzej S. Murawski, Joel Ouaknine, Björn Wachter & James Worrell (2011):
Language Equivalence for Probabilistic Automata.
In: Proc. of CAV '11.
Springer,
pp. 526–540,
doi:10.1007/978-3-642-22110-1_42.
LNCS 6806.
Barbara König & Sebastian Küpper (2014):
Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata.
In: Proc. of TCS '14,
IFIP AICT.
Springer,
pp. 311–325,
doi:10.1007/978-3-662-44602-7_24.
LNCS 8705.
Barbara König & Sebastian Küpper (2016):
A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata.
Soft Computing,
pp. 1–18,
doi:10.1007/s00500-016-2363-z.
Daniel Krob (1994):
The equality problem for rational series with multiplicities in the tropical semiring is undecidable.
International Journal of Algebra and Computation 4(3),
pp. 405–425,
doi:10.1142/S0218196794000063.
Orna Kupferman & Yoad Lustig (2010):
Latticed Simulation Relations and Games.
International Journal of Foundations of Computer Science 21(02),
pp. 167–189,
doi:10.1142/S0129054110007192.
Christine Mika (2015):
Ein generisches Werkzeug für Sprachäquivalenz bei gewichteten Automaten.
Universität Duisburg-Essen.
A. Paz (1971):
Introduction to Probabilistic Automata.
Academic Press, New York.
Marcel-Paul Schützenberger (1961):
On the Definition of a Family of Automata.
Information and Control 4(2–3),
pp. 245–270,
doi:10.1016/s0019-9958(61)80020-x.
Wen-Guey Tzeng (1992):
A polynomial-time algorithm for the equivalence of probabilistic automata.
SIAM Journal on Computing 21(2),
pp. 216–227,
doi:10.1137/0221017.