Skip to main content
SpringerLink
Log in

Effective Reductions of Mealy Machines

  • Conference paper
  • First Online:
Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13273))

Abstract

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 [1] 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For instructions to reproduce, see https://www.lrde.epita.fr/~philipp/forte22/.

  2. 2.

    A 30 min timeout was enforced for all instances. The benchmarks were run on an Asus G14 with a Ryzen 4800HS CPU with 16GB of RAM and no swap.

  3. 3.

    See: https://spot.lrde.epita.fr/ipynb/synthesis.html.

References

  1. Abel, A., Reineke, J.: MeMin: SAT-based exact minimization of incompletely specified Mealy machines. In: ICCAD 2015, pp. 94–101. IEEE Press (2015)

    Google Scholar 

  2. Alberto, A., Simao, A.: Minimization of incompletely specified finite state machines based on distinction graphs. In: LATW 2009, pp. 1–6. IEEE (2009)

    Google Scholar 

  3. Alberto, A., Simao, A.: Iterative minimization of partial finite state machines. Open Comput. Sci. 3(2), 91–103 (2013). https://doi.org/10.2478/s13537-013-0106-0

  4. Babiak, T., Badie, T., Duret-Lutz, A., Křetínský, M., Strejček, J.: Compositional approach to suspension and other improvements to LTL translation. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol. 7976, pp. 81–98. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39176-7_6

    Chapter  Google Scholar 

  5. Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, É., Xu, L.: Spot 2.0 — a framework for LTL and \(\omega \)-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122–129. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46520-3_8

    Chapter  Google Scholar 

  6. Etessami, K., Holzmann, G.J.: Optimizing Büchi Automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153–168. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44618-4_13

    Chapter  Google Scholar 

  7. Henzinger, M., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: Proceedings of the 36th Symposium on Foundations of Computer Science, pp. 453–462 (1995)

    Google Scholar 

  8. Hopcroft, J.: An \(n \log n\) algorithm for minimizing states in a finite automaton. In: Proceedings of an International Symposium on the Theory of Machines and Computations, pp. 189–196. Academic Press (1971)

    Google Scholar 

  9. Jacobs, S., Bloem, R.: The 5th reactive synthesis competition-SYNTCOMP 2018 (2020)

    Google Scholar 

  10. Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: A fully implicit algorithm for exact state minimization. In: 31st Design Automation Conference, pp. 684–690. IEEE (1994)

    Google Scholar 

  11. Minato, S.: Fast generation of irredundant sum-of-products forms from binary decision diagrams. In: SASIMI 1992, pp. 64–73 (1992)

    Google Scholar 

  12. Paull, M.C., Unger, S.H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans. Electron. Comput. EC-8(3), 356–367 (1959)

    Google Scholar 

  13. Pena, J., Oliveira, A.: A new algorithm for exact reduction of incompletely specified finite state machines. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(11), 1619–1632 (1999)

    Article  Google Scholar 

  14. Pfleeger, C.P.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. C-22(12), 1099–1102 (1973)

    Google Scholar 

  15. Renkin, F., Schlehuber, P., Duret-Lutz, A., Pommellet, A.: Improvements to ltlsynt. Presented at the SYNT 2021 Workshop, without Proceedings, July 2021. https://www.lrde.epita.fr/~adl/dl/adl/renkin.21.synt.pdf

  16. Rho, J.-K., Hachtel, G., Somenzi, F., Jacoby, R.: Exact and heuristic algorithms for the minimization of incompletely specified state machines. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(2), 167–177 (1994)

    Article  Google Scholar 

  17. Yang, S.: Logic synthesis and optimization benchmarks user guide: version 3.0. Citeseer (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRDE, EPITA, Kremlin-Bicêtre, France

    Florian Renkin, Philipp Schlehuber-Caissier, Alexandre Duret-Lutz & Adrien Pommellet

Authors
  1. Florian Renkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philipp Schlehuber-Caissier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandre Duret-Lutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Adrien Pommellet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florian Renkin .

Editor information

Editors and Affiliations

  1. King's College London, London, UK

    Mohammad Reza Mousavi

  2. University of Cyprus, Nicosia, Cyprus

    Anna Philippou

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Renkin, F., Schlehuber-Caissier, P., Duret-Lutz, A., Pommellet, A. (2022). Effective Reductions of Mealy Machines. In: Mousavi, M.R., Philippou, A. (eds) Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2022. Lecture Notes in Computer Science, vol 13273. Springer, Cham. https://doi.org/10.1007/978-3-031-08679-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-08679-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-08678-6

  • Online ISBN: 978-3-031-08679-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation