Quantitative Simulations by Matrices

10/22/2018
by   Natsuki Urabe, et al.
0

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 against 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. Furthermore, an extension to weighted tree automata is presented and implemented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2018

Quantitative Matrix Simulation

We introduce notions of simulation between semiring-weighted automata as...
research
01/17/2020

Pumping lemmas for weighted automata

We present pumping lemmas for five classes of functions definable by fra...
research
07/15/2022

Zone-based verification of timed automata: extrapolations, simulations and what next?

Timed automata have been introduced by Rajeev Alur and David Dill in the...
research
12/17/2018

Comparator automata in quantitative verification

The notion of comparison between system runs is fundamental in formal ve...
research
07/27/2023

An Automata Theoretic Characterization of Weighted First-Order Logic

Since the 1970s with the work of McNaughton, Papert and Schützenberger, ...
research
07/05/2020

Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling

The search for a proof of correctness and the search for counterexamples...

Please sign up or login with your details

Forgot password? Click here to reset