Skip to main content

Conservative Determinization of Translated Automata by Embedded Subset Construction

  • Conference paper
  • First Online:
Intelligent Decision Technologies (IDT 2020)

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 193))

Included in the following conference series:

Abstract

A translated finite automaton (TFA) results from a translation of a deterministic finite automaton (DFA). A translation is based on a mapping from the alphabet of the DFA to a new alphabet, where each symbol in the original alphabet is substituted with a symbol in the new alphabet. When this substitution generates a nondeterministic automaton, the TFA may need to be determinized into an equivalent DFA. Determinization of TFAs may be useful in a variety of domains, specifically in model-based diagnosis of discrete-event systems, where large TFAs constructed by model-based reasoning are processed to perform knowledge compilation. Since, in computation time, the classical Subset Construction determinization algorithm may be less than optimal when applied to large TFAs, a conservative algorithm is proposed, called Embedded Subset Construction. This alternative algorithm updates the TFA based on the mapping of the alphabet rather than building a new DFA from scratch. This way, in contrast with Subset Construction, which performs an exhaustive processing of the TFA to be determinized, the portion of the TFA that does not require determinization is not processed. Embedded Subset Construction is sound and complete, thereby yielding a DFA that is identical to the DFA generated by Subset Construction. The benefit of using Embedded Subset Construction largely depends on the portion of the TFA that actually requires determinization. Experimental results indicate the viability of Embedded Subset Construction, especially so when large TFAs are affected by small portions of nondeterminism.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Aho, A., Lam, M., Sethi, R., Ullman, J.: Compilers—Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading, MA (2006)

    Google Scholar 

  2. Bertoglio, N., Lamperti, G., Zanella, M.: Intelligent diagnosis of discrete-event systems with preprocessing of critical scenarios. In: Czarnowski, I., Howlett, R., Jain, L. (eds.) Intelligent Decision Technologies 2019, Smart Innovation, Systems and Technologies, vol. 142, pp. 109–121. Springer, Singapore (2020). https://doi.org/10.1007/978-981-13-8311-3_10

  3. Bertoglio, N., Lamperti, G., Zanella, M., Zhao, X.: Twin-engined diagnosis of discrete-event systems. Eng. Reports 1, 1–20 (2019). https://doi.org/10.1002/eng2.12060

    Article  Google Scholar 

  4. Brognoli, S., Lamperti, G., Scandale, M.: Incremental determinization of expanding automata. Comput. J. 59(12), 1872–1899 (2016). https://doi.org/10.1093/comjnl/bxw044

    Article  MathSciNet  Google Scholar 

  5. Caniato, G., Lamperti, G.: Online determinization of large mutating automata. In: Howlett, R., Toro, C., Hicks, Y., Jain, L. (eds.) Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference, KES-2018, Belgrade, Serbia, Procedia Computer Science, vol. 126, pp. 59–68. Elsevier (2018). https://doi.org/10.1016/j.procs.2018.07.209

  6. Cassandras, C., Lafortune, S.: Introduction to Discrete Event Systems, 2nd edn. Springer, New York (2008)

    Google Scholar 

  7. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, Reading, MA (2006)

    Google Scholar 

  8. Lamperti, G.: Temporal determinization of mutating finite automata: Reconstructing or restructuring. Software: Practice and Experience, pp. 1–31 (2019). https://doi.org/10.1002/spe.2776

  9. Lamperti, G., Zanella, M., Chiodi, G., Chiodi, L.: Incremental determinization of finite automata in model-based diagnosis of active systems. In: Lovrek, I., Howlett, R., Jain, L. (eds.) Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes in Artificial Intelligence, vol. 5177, pp. 362–374. Springer, Berlin, Heidelberg (2008)

    Google Scholar 

  10. Lamperti, G., Zanella, M., Zhao, X.: Abductive diagnosis of complex active systems with compiled knowledge. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018), pp. 464–473. AAAI Press, Tempe, Arizona (2018)

    Google Scholar 

  11. Lamperti, G., Zanella, M., Zhao, X.: Introduction to Diagnosis of Active Systems. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92733-6

  12. Lamperti, G., Zhao, X.: Decremental subset construction. In: Czarnowski, I., Howlett, R., Jain, L. (eds.) Intelligent Decision Technologies 2017, Smart Innovation, Systems and Technologies, vol. 72, pp. 22–36. Springer International Publishing (2018). https://doi.org/10.1007/978-3-319-59421-7_3

  13. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959). https://doi.org/10.1147/rd.32.0114

    Article  MathSciNet  MATH  Google Scholar 

  14. Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.: Diagnosability of discrete-event systems. IEEE Trans. Autom. Control 40(9), 1555–1575 (1995)

    Article  MathSciNet  Google Scholar 

  15. Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.: Failure diagnosis using discrete-event models. IEEE Trans. Control Syst. Technol. 4(2), 105–124 (1996)

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank the anonymous reviewers for their constructive comments, which help improve the quality of the final paper. This work was supported in part by Regione Lombardia (Smart4CPPS, Linea Accordi per Ricerca, Sviluppo e Innovazione, POR-FESR 2014–2020 Asse I) and by the National Natural Science Foundation of China (grant number 61972360).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gianfranco Lamperti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dusi, M., Lamperti, G. (2020). Conservative Determinization of Translated Automata by Embedded Subset Construction. In: Czarnowski, I., Howlett, R., Jain, L. (eds) Intelligent Decision Technologies. IDT 2020. Smart Innovation, Systems and Technologies, vol 193. Springer, Singapore. https://doi.org/10.1007/978-981-15-5925-9_5

Download citation

Publish with us

Policies and ethics