[Lrde Annonce] Paper accepted at FORTE'22: Effective Reductions of Mealy Machines

We are happy to announce that the following article has been accepted to the 42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE'22), one of the three conference of the 17th International Federated Conference on Distributed Computing Techniques (DisCoTec'22) to be held on June 13-17 in Lucca, Italy. (Philipp will go there to present the paper.) ====================================================================== Effective Reductions of Mealy Machines Florian Renkin, Philipp Schlehuber-Caissier, Alexandre Duret-Lutz, Adrien Pommellet LRDE, EPITA, France We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool MeMin and solves the minimization problem, the latter is a novel approach derived from simulation-based reductions but may not guarantee a minimized machine. However, we argue that it offers a good enough compromise between the size of the resulting Mealy machine and performance. The proposed methods are benchmarked against MeMin on a large collection of test cases made of well-known instances as well as new ones. https://www.lrde.epita.fr/wiki/Publications/renkin.22.forte ======================================================================