Skip to main content
SpringerLink
Log in

Automata Based Model Checking for Reo Connectors

  • Conference paper
Fundamentals of Software Engineering (FSEN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5961))

Included in the following conference series:

Abstract

Reo is a connector language for the exogenous composition and orchestration of components in a software system. An operational semantics of Reo connectors can be given in terms of Büchi automata over a suitable alphabet of records, capturing both synchronization and context dependency requirements. In this paper, we define an action based linear time temporal logic for expressing properties of Reo connectors. Formulas can be synthesized into Büchi automata representing Reo connectors, thus leading to an automata based model checking algorithm. By generalizing standard automata based model checking algorithms for linear time temporal logic, we give an efficient on-the-fly algorithm for the model checking of formulas for Reo connectors.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbab, F.: Reo: a Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science 14(3), 329–366 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arbab, F., Rutten, J.J.M.M.: A Coinductive Calculus of Component Connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003)

    Google Scholar 

  3. Arbab, F., Baier, C., de Boer, F., Rutten, J.J.M.M.: Models and Temporal Logics for Timed Component Connectors. In: Proc. of SEFM 2004, pp. 198–207. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  4. Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modelling Component Connectors in Reo by Constraint Automata. Science of Computer Programming 61, 75–113 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)

    Google Scholar 

  6. Clarke, D.: Reasoning about Connector Reconfiguration II: Basic reconfiguration Logic. In: Proc. of FSEN 2005. ENTCS, vol. 159, pp. 61–77. Elsevier, Amsterdam (2006)

    Google Scholar 

  7. Clarke, D., Costa, D., Arbab, F.: Connector Colouring I: Synchronisation and Context Dependency. Science of Computer Programming 66(3), 205–225 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Costa, D.: Intensional Constraint Automata. Unpublished notes (2008)

    Google Scholar 

  9. Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: Proc. of the Int. Sym. on Protocol Specification, Testing, and Verification (PSTV 1995), pp. 3–18. Chapman & Hall, Boca Raton (1995)

    Google Scholar 

  10. Holzmann, G.J.: The Model Checker SPIN. IEEE Transactions on Software Engineering 23(5), 279–295 (1997)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  12. Izadi, M., Bonsangue, M.M.: Recasting Constraint Automata into Büchi Automata. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 156–170. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Izadi, M., Bonsangue, M.M., Clarke, D.: Modeling Component Connectors: Synchronisation and Context-Dependency. In: Proc. of SEFM 2008, pp. 303–312. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  14. Kaplan, D.M.: Regular Expressions and the Equivalence of Programs. Journal of Compiting System Science 3, 361–386 (1969)

    MATH  Google Scholar 

  15. Klüppelholz, S., Baier, C.: Symbolic Model Checking for Channel-based Component Connectors. In: Proc. of FOCLASA 2006. ENTCS, vol. 175(2), pp. 19–37. Elsevier, Amsterdam (2007)

    Google Scholar 

  16. Kozen, D.: Automata on guarded strings and applications. Matématica Contemporânea 24, 117–139 (2003)

    MATH  MathSciNet  Google Scholar 

  17. Kupferman, O., Vardi, M.: Verification of Fair Transition Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 372–382. Springer, Heidelberg (1996)

    Google Scholar 

  18. Madhusudan, P.: On the Fly Model Checking for Linear Time Temporal Logic. M.Sc. Thesis, Anna University, Madras, India (1996)

    Google Scholar 

  19. Remy, D.: Efficient Representation of Extensible Records. In: Proc. ACM SIGPLAN Workshop on ML and its applications, pp. 12–16 (1994)

    Google Scholar 

  20. Tsay, Y., Chen, Y., Tsai, M., Wu, K., Chan, W.: GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 466–471. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Vardi, M.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)

    Google Scholar 

  22. Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proc. of (LICS 1986), pp. 322–331 (1986)

    Google Scholar 

  23. Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACS - Leiden University, The Netherlands

    Marcello M. Bonsangue & Mohammad Izadi

  2. Centrum voor Wiskunde en Informatica (CWI), The Netherlands

    Marcello M. Bonsangue

  3. Dept. of Computer Engineering, Sharif University of Technology, Tehran, Iran

    Mohammad Izadi

  4. Research Institute for Humanities and Cultural Studies, Tehran, Iran

    Mohammad Izadi

Authors
  1. Marcello M. Bonsangue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Izadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Mathematics and Computer Science (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Farhad Arbab

  2. Reykjavik University, School of Computer Science, Kringlan 1, 103, Reykjavik, Iceland

    Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonsangue, M.M., Izadi, M. (2010). Automata Based Model Checking for Reo Connectors. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2009. Lecture Notes in Computer Science, vol 5961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11623-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11623-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11622-3

  • Online ISBN: 978-3-642-11623-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation