Skip to main content
SpringerLink
Log in

An Improved Upper Bound for the Length of Preset Distinguishing Sequences of Distinguished Merging Finite State Machines

  • Conference paper
  • First Online:
Information Sciences and Systems 2014

  • 794 Accesses

Abstract

In an earlier work, we have studied a special class of FiniteState Machines (FSMs) called Distinguished Merging FSMs (DMFSMs) and showed that one can construct a Preset Distinguishing Sequence (PDS) for a DMFSM with \(n\) states, \(p\) input symbols, and \(r\) output symbols in time \(O(n^4+pn^2)\) of length no longer than \(O(n^3)\). In this work, we improve the upper bound for the length of a PDS to \((n-1)^2\), and present an algorithm to construct such a PDS for a DMFSM in time \(O(n^4+pn^2)\) or in time \(O(rn^3+pn^2)\).

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.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. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools (Addison-Wesley, Reading, 1986)

    Google Scholar 

  2. M. Barnett, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann, M. Veanes, Towards a tool environment for model-based testing with AsmL. in Formal Approaches to Testing, volume 2931 of Lecture Notes in Computer Science, pp. 252–266, Montreal, Canada, 2003. Springer-Verlag

    Google Scholar 

  3. R.V. Binder, Testing Object-Oriented Systems: Models, Patterns, and Tools (Addison-Wesley, Reading, 1999)

    Google Scholar 

  4. E.G. Cartaxo, P.D.L. Machado, F.G.O. Neto, On the use of a similarity function for test case selection in the context of model-based testing. Softw. Test. Verif. Reliab. 21(2), 75–100 (2011)

    Article  Google Scholar 

  5. T.S. Chow, Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178–187 (1978)

    Article  MATH  Google Scholar 

  6. A.D. Friedman, P.R. Menon, Fault Detection in Digital Circuits, Computer Applications in Electrical Engineering Series (Prentice-Hall, Englewood Cliffs, 1971)

    Google Scholar 

  7. E. Gelenbe, Regular expressions and checking experiments. Technical Report AD0666696, Polytechnic Institute of Brooklyn NY Microwave Research Institue, September 1967. Defense Technical Information Center

    Google Scholar 

  8. G. Gönenç, A method for the design of fault detection experiments. IEEE Trans. Comput. 19(6), 551–558 (1970)

    Article  MATH  Google Scholar 

  9. W. Grieskamp, N. Kicillof, K. Stobie, V.A. Braberman, Model-based quality assurance of protocol documentation: tools and methodology. Softw. Test. Verif. Reliab. 21(1), 55–71 (2011)

    Article  Google Scholar 

  10. C. Gunicen, K. Inan, U.C. Turker, H. Yenigun, The relation between preset distinguishing sequences and synchronizing sequences. Formal Aspects of Computing (2014)

    Google Scholar 

  11. F.C. Hennie, Fault-detecting experiments for sequential circuits. in: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp. 95–110, Princeton, New Jersey, November 1964

    Google Scholar 

  12. R.M. Hierons, G.V. Jourdan, H. Ural, H. Yenigun, Using adaptive distinguishing sequences in checking sequence constructions, in R.L. Wainwright and H. Haddad, editors, SAC, pp. 682–687. ACM, Mar 2008

    Google Scholar 

  13. R.M. Hierons, G.V. Jourdan, H. Ural, H. Yenigun, Checking sequence construction using adaptive and preset distinguishing sequences, in D.V. Hung and P. Krishnan, editors, SEFM, pp. 157–166. IEEE Computer Society, 2009

    Google Scholar 

  14. G.J. Holzmann, Design and Validation of Computer Protocols (Prentice Hall, Englewood Cliffs, 1991)

    Google Scholar 

  15. Z. Kohavi, Switching and Finite State Automata Theory (McGraw-Hill, NY, 1978)

    Google Scholar 

  16. D. Lee, M. Yannakakis, Testing finite-state machines: State identification and verification. IEEE Trans. Comput. 43(3), 306–320 (1994)

    Article  MathSciNet  Google Scholar 

  17. D. Lee, M. Yannakakis, Principles and methods of testing finite-state machines—a survey. Proc. the IEEE 84(8), 1089–1123 (1996)

    Article  Google Scholar 

  18. A. Petrenko, N. Yevtushenko, Testing from partial deterministic FSM specifications. IEEE Trans. Comput. 54(9), 1154–1165 (2005)

    Article  Google Scholar 

  19. I.K. Rystsov, Polynomial complete problems in automata theory. Inf. Process. Lett. 16(3), 147–151 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sabanci University, 34956, Orhanli, Tuzla, Istanbul, Turkey

    Canan Güniçen, Kemal İnan, Uraz Cengiz Türker & Hüsnü Yenigün

Authors
  1. Canan Güniçen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kemal İnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Uraz Cengiz Türker
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hüsnü Yenigün
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hüsnü Yenigün .

Editor information

Editors and Affiliations

  1. Polish Academy of Sciences, Gliwice, Poland

    Tadeusz Czachórski

  2. Imperial College London, London, United Kingdom

    Erol Gelenbe

  3. Imperial College London, London, United Kingdom

    Ricardo Lent

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Güniçen, C., İnan, K., Türker, U.C., Yenigün, H. (2014). An Improved Upper Bound for the Length of Preset Distinguishing Sequences of Distinguished Merging Finite State Machines. In: Czachórski, T., Gelenbe, E., Lent, R. (eds) Information Sciences and Systems 2014. Springer, Cham. https://doi.org/10.1007/978-3-319-09465-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09465-6_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09464-9

  • Online ISBN: 978-3-319-09465-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation