Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo—hence soundness wrt. language inclusion comes for free—but are concretely presented as matrices that are subject to linear inequality constraints. Pervasiveness of these formalisms allows us to exploit existing algorithms in: searching for a simulation, and hence verifying quantitative correctness that is formulated as language inclusion. Transformations of automata that aid search for simulations are introduced, too. This verification workflow is implemented for the plus-times and max-plus semirings.
KeywordsLinear Inequality Simulation Matrice Linear Inequality Constraint Probabilistic Automaton Payoff Game
Unable to display preview. Download preview PDF.
- 1.The GNU linear programming kit, http://www.gnu.org/software/glpk
- 2.Akian, M., Gaubert, S., Guterman, A.E.: Tropical polyhedra are equivalent to mean payoff games. International Journal of Algebra and Computation 22(1) (2012)Google Scholar
- 7.Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science 6(3) (2010)Google Scholar
- 14.Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science 3(4) (2007)Google Scholar
- 17.Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations, Draft of a book (ver. 2.0) (2012) (available online)Google Scholar
- 18.Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266–277. IEEE Computer Society (1991)Google Scholar
- 24.Pin, J.E.: Tropical semirings. Idempotency (Bristol, 1994), 50–69 (1998)Google Scholar