Skip to main content

Incremental Determinization of Finite Automata in Model-Based Diagnosis of Active Systems

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5177))

Abstract

Generating a deterministic finite automaton (DFA) equivalent to a nondeterministic one (NFA) is traditionally accomplished by subset-construction (SC). This is the right choice in case a single transformation is needed. If, instead, the NFA is repeatedly extended, one transition each time, and the DFA corresponding to each extension is needed in real-time, SC is bound to poor performances. In order to cope with these difficulties, an algorithm called incremental subset-construction (ISC) is proposed, which makes up the new DFA as an extension of the previous DFA, avoiding to start from scratch each time, thereby pursuing computational reuse. Although conceived within the application domain of model-based diagnosis of active systems, the algorithm is general in nature, hence it can be exploited for incremental determinization of any NFA. Massive experimentation indicates that, while comparable in space complexity, incremental determinization of finite automata is, in time, far more efficient than traditional determinization by SC.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lamperti, G., Zanella, M.: Diagnosis of Active Systems – Principles and Techniques. The Kluwer International Series in Engineering and Computer Science, vol. 741. Kluwer Academic Publisher, Dordrecht (2003)

    MATH  Google Scholar 

  2. Lamperti, G., Zanella, M.: A bridged diagnostic method for the monitoring of polymorphic discrete-event systems. IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics 34(5), 2222–2244 (2004)

    Article  Google Scholar 

  3. Cerutti, S., Lamperti, G., Scaroni, M., Zanella, M., Zanni, D.: A diagnostic environment for automaton networks. Software – Practice and Experience 37(4), 365–415 (2007)

    Article  Google Scholar 

  4. Lamperti, G., Zanella, M., Zanni, D.: Incremental processing of temporal observations in model-based reasoning. AI Communications 20(1), 27–37 (2007)

    MATH  MathSciNet  Google Scholar 

  5. Revuz, D.: Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France (1991)

    Google Scholar 

  6. Daciuk, J.: Incremental construction of finite-state automata and transducers, and their use in the natural language processing. PhD thesis, University of Gdansk, Poland (1998)

    Google Scholar 

  7. Daciuk, J., Watson, B., Watson, R.: Incremental construction of minimal acyclic finite state automata and transducers. In: International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, pp. 48–56 (1998)

    Google Scholar 

  8. Daciuk, J., Mihov, S., Watson, B., Watson, R.: Incremental construction of minimal acyclic finite state automata. Computational Linguistics 26(1), 3–16 (2000)

    Article  MathSciNet  Google Scholar 

  9. Carrasco, R., Forcada, M.: Incremental construction and maintenance of minimal finite-state automata. Computational Linguistics 28(2), 207–216 (2002)

    Article  MathSciNet  Google Scholar 

  10. Daciuk, J.: Semi-incremental addition of strings to a cyclic finite automaton. In: Klopotek, M., Wierzchon, S., Trojanowski, K. (eds.) Advances in Soft Computing, pp. 201–207. Springer, Heidelberg (2004)

    Google Scholar 

  11. Watson, B., Daciuk, J.: An efficient incremental dfa minimization algorithm. Natural Language Engineering 9(1), 49–64 (2003)

    Article  Google Scholar 

  12. Green, T., Gupta, A., Miklau, G., Onizuka, M., Suciu, D.: Processing xml streams with deterministic automata and stream indexes. ACM Transactions on Database Systems 29(4), 752–788 (2004)

    Article  Google Scholar 

  13. Lamperti, G., Zanella, M.: Monitoring and diagnosis of discrete-event systems with uncertain symptoms. In: Sixteenth International Workshop on Principles of Diagnosis – DX 2005, Monterey, CA, pp. 145–105 (2005)

    Google Scholar 

  14. Hamscher, W., Console, L., de Kleer, J. (eds.): Readings in Model-Based Diagnosis. Morgan Kaufmann, San Mateo (1992)

    Google Scholar 

  15. Dvorak, D., Kuipers, B.: Model-based monitoring of dynamic systems. In: Eleventh International Joint Conference on Artificial Intelligence – IJCAI 1989, Detroit, MI, pp. 1238–1243 (1989)

    Google Scholar 

  16. Lackinger, F., Nejdl, W.: Integrating model-based monitoring and diagnosis of complex dynamic systems. In: Twelfth International Joint Conference on Artificial Intelligence – IJCAI 1991, Sydney, Australia, pp. 2893–2898 (1991)

    Google Scholar 

  17. Struss, P.: Fundamentals of model-based diagnosis of dynamic systems. In: Fifteenth International Joint Conference on Artificial Intelligence – IJCAI 1997, Nagoya, Japan, pp. 480–485. Morgan Kaufmann, S. Francisco (1997)

    Google Scholar 

  18. Cassandras, C., Lafortune, S.: Introduction to Discrete Event Systems. The Kluwer International Series in Discrete Event Dynamic Systems, vol. 11. Kluwer Academic Publisher, Boston (1999)

    MATH  Google Scholar 

  19. Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of ACM 30(2), 323–342 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  20. Baroni, P., Lamperti, G., Pogliano, P., Zanella, M.: Diagnosis of large active systems. Artificial Intelligence 110(1), 135–183 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lamperti, G., Zanella, M.: Diagnosis of discrete-event systems from uncertain temporal observations. Artificial Intelligence 137(1–2), 91–163 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ignac Lovrek Robert J. Howlett Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lamperti, G., Zanella, M., Chiodi, G., Chiodi, L. (2008). Incremental Determinization of Finite Automata in Model-Based Diagnosis of Active Systems. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85563-7_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85563-7_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85562-0

  • Online ISBN: 978-3-540-85563-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics