Up-To Techniques for Weighted Systems (Extended Version)

We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for weighted automata. We build a bisimulation relation on the fly and work up-to congruence and up-to similarity. This requires to determine whether a pair of vectors (over a semiring) is in the congruence closure of a given relation of vectors. This problem is considered for rings and l-monoids, for the latter we provide a rewriting algorithm and show its confluence and termination. We then explain how to apply these up-to techniques to weighted automata and provide runtime results.

[1]  Natarajan Shankar,et al.  On Shostak's Decision Procedure for Combinations of Theories , 1996, CADE.

[2]  Ichiro Hasuo,et al.  Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices , 2014, CONCUR.

[3]  Alexandra Silva,et al.  Enhanced coalgebraic bisimulation , 2015, Mathematical Structures in Computer Science.

[4]  Jurriaan Rot,et al.  Coinduction up-to in a fibrational setting , 2014, CSL-LICS.

[5]  Jacques Sakarovitch,et al.  Conjugacy and Equivalence of Weighted Automata and Functional Transducers , 2006, CSR.

[6]  Jean-François Raskin,et al.  Antichain Algorithms for Finite Automata , 2010, TACAS.

[7]  Damien Pous,et al.  Checking NFA equivalence with bisimulations up to congruence , 2013, POPL.

[8]  Parosh Aziz Abdulla,et al.  When Simulation Meets Antichains(on Checking Language Inclusion of NFA) , 2010 .

[9]  Michele Boreale,et al.  Weighted Bisimulation in Linear Algebraic Form , 2009, CONCUR.

[10]  Alexandra Silva,et al.  A coalgebraic perspective on linear weighted automata , 2011, Inf. Comput..

[11]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[12]  Daniel Krob,et al.  The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[13]  Stéphane Gaubert,et al.  Methods and Applications of (MAX, +) Linear Algebra , 1997, STACS.

[14]  Eugene W. Stark,et al.  On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation , 2003, J. Autom. Lang. Comb..