Skip to main content
SpringerLink
Log in

A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems

Extended Abstract

  • Conference paper
Implementation and Application of Automata (CIAA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4094))

Included in the following conference series:

  • 409 Accesses

Abstract

We address the model-checking problem of viz. communicating finite-state machines (in short, CFSMs) [1,2,6], an infinite system which are modelled as a collection of finite state automata communicating messages through FIFO queues. Several verification methods have been developed for CFSMs. Since all interesting verification problems are undecidable [4], there is in general no completely automatic verification procedure for this class of systems.

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

References

  1. Abdulla, P.A., Jonsson, B.: Undecidable Verification Problems for Programs with Unreliable Channels. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 316–327. Springer, Heidelberg (1994)

    Google Scholar 

  2. Boigelot, B., Godefroid, P.: Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 1–12. Springer, Heidelberg (1996)

    Google Scholar 

  3. Boigelot, B., Godefroid, P., Willems, P., Wolper, P.: The power of QDDS. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172–186. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Brand, D., Zafiropulo, P.: On Communicating Finite-state Machines. Journal of the ACM 2(5), 323–342 (1983)

    Article  MathSciNet  Google Scholar 

  5. Brzozowski, J.A.: Derivatives of Regular Expressions. Journal of the ACM 11(4), 481–494 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  6. Finkel, A., Purushothaman Iyer, S., Sutre, G.: Well-Abstracted Transition Systems: Application to FIFO Automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 566. Springer, Heidelberg (2000); Also, Information and Computation 181(1), 1–31 (2003)

    Chapter  Google Scholar 

  7. Jéron, T.: Testing for unboundedness of FIFO Channels. Theoretical Computer Science 113, 93–117 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Roy, S.: A Symbolic Representation of Unbounded Queue Contents by a Finite Union of DFAs. In: International Workshop AVIS (ETAPS), Warsaw (2003)

    Google Scholar 

  9. Roy, S.: Symbolic Verification of Infinite Systems using a Finite Union of DFAs. In: 2nd IEEE International Conference on Software Engineering and Formal Methods (SEFM), Beijing (September 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Honeywell Technology Solutions Lab. (HTSL), 151/1, Doraisanipalya, Bannerghatta Road, Bangalore, 560 076, India

    Suman Roy

  2. Indian Statistical Institute, 203 Barrackpore Trunk Road, Kolkata, 700108, India

    Bhaskar Chakraborty

Authors
  1. Suman Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bhaskar Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roy, S., Chakraborty, B. (2006). A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_27

Download citation

  • DOI: https://doi.org/10.1007/11812128_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37213-4

  • Online ISBN: 978-3-540-37214-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation