skip to main content
10.1145/1450058.1450085acmconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
research-article

Compositional analysis of deadlock-freedom for tree-like component architectures

Published:19 October 2008Publication History

ABSTRACT

We study architectural constraints for component systems in order to be able to guarantee safety-properties. Representing safety-properties, we investigate deadlock-freedom. We present a compositional and hence polynomial time condition for deadlock-freedom for a class of component-systems whose architecture is tree-like. The architectural constraints that are developed can be understood as a design pattern that helps to construct systems satisfying safety-properties on the one hand. On the other hand, they might help to draw attention to potentially critical situations in a design. To model component-systems we use the formalism of interaction systems as proposed by Sifakis et al. The ideas can be transferred to other formal models where subsystems are cooperating via synchronous communication.

References

  1. R. Allen and D. Garlan. A Formal Basis for Architectural Connection. ACM Trans. Softw. Eng. Methodol., 6(3):213--249, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. F. Arbab. Abstract Behavior Types: A Foundation Model for Components and Their Composition. In Proceedings of FMCO'02, volume 2852 of LNCS, pages 339--360, 2003.Google ScholarGoogle Scholar
  3. P. Attie and H. Chockler. Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. In Proceedings of VMCAI'05, volume 3385 of LNCS, pages 465--481, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. Badouel, A. Benveniste, M. Bozga, B. Caillaud, O.Constant, B. Josko, Q. Ma, R. Passerone, and M. Skipper. SPEEDS Metamodel Syntax and Draft Semantics, January 2007. Deliverable D2.1c.Google ScholarGoogle Scholar
  5. R. Bastide and E. Barboni. Software Components: A Formal Semantics Based on Coloured Petri Nets. In Proceedings of FACS'05, ENTCS, 2005.Google ScholarGoogle Scholar
  6. A. Basu, M. Bozga, and J. Sifakis. Modeling Heterogeneous Real-Time Components in BIP. In Proceedings of SEFM'06, pages 3--12. IEEE Computer Society, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Baumeister, F. Hacklinger, R. Hennicker, A. Knapp, and M. Wirsing. A Component Model for Architectural Programming. In Proceedings of FACS'05, volume 160 of ENTCS, pages 75--96. Elsevier, 2006.Google ScholarGoogle Scholar
  8. M. Bernardo, P. Ciancarini, and L. Donatiello. Architecting Families of Software Systems with Process Algebras. ACM Trans. on Software Engineering and Methodology, 11:386 -- 426, October 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Bozga, O.Constant, B. Josko, Q. Ma, and M. Skipper. SPEEDS Metamodel Syntax and Static Semantics, February 2007. Deliverable D2.1b.Google ScholarGoogle Scholar
  10. M. Broy. Towards a Logical Basis of Software Engineering. In M. Broy and R. Steinbrüggen, editors, Calculational System Design, IOS 1999, volume 158 of NATO ASI Series, Series F: Computer and System Sciences, pages 101 -- 131. 1999.Google ScholarGoogle Scholar
  11. S. Chouali, M. Heisel, and J. Souquières. Proving Component Interoperability with B Refinement. In Proceedings of FACS 05, volume 160 of ENTCS, pages 67--84, 2006.Google ScholarGoogle Scholar
  12. L. de Alfaro and T. A. Henzinger. Interface Automata. In Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE 01), pages 109--120, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Godefroid and P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Form. Methods Syst. Des., 2(2):149--164, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Gössler. Component-based Design of Heterogeneous Reactive Systems in Prometheus. Technical report 6057, INRIA, December 2006.Google ScholarGoogle Scholar
  15. G. Gössler, S. Graf, M. Majster-Cederbaum, M. Martens, and J. Sifakis. An Approach to Modelling and Verification of Component Based Systems. In Proceedings of SOFSEM 07, volume 4362 of LNCS, pages 295--308, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Gössler, S. Graf, M. Majster-Cederbaum, M. Martens, and J. Sifakis. Ensuring Properties of Interaction Systems. In Program Analysis and Computation, Theory and Practice, volume 4444 of LNCS, pages 201--224, 2007.Google ScholarGoogle Scholar
  17. G. Gössler and J. Sifakis. Component-Based Construction of Deadlock-Free Systems. In Proceedings of FSTTCS'03, volume 2914 of LNCS, pages 420--433, 2003.Google ScholarGoogle Scholar
  18. G. Gössler and J. Sifakis. Composition for Component-Based Modeling. In Proceedings of FMCO 02, volume 2852 of LNCS, pages 443--466, 2003.Google ScholarGoogle Scholar
  19. G. Gössler and J. Sifakis. Priority Systems. In Proceedings of FMCO'03), volume 3188 of LNCS, pages 314--329, 2004.Google ScholarGoogle Scholar
  20. G. Gössler and J. Sifakis. Composition for component-based modeling. Sci. Comput. Program., 55(1-3):161--183, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. P. Inverardi and S. Uchitel. Proving Deadlock Freedom in Component-Based Programming. In Proceedings of FASE'01, volume 2029 of LNCS, pages 60--75, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. N. A. Lynch and M. R. Tuttle. An Introduction to Input/Output Automata. CWI-Quarterly, 2(3):219--246, Sept. 1989.Google ScholarGoogle Scholar
  23. M. Majster-Cederbaum and M. Martens. Robustness in Interaction Systems. In Proceedings of FORTE'07, volume 4574 of LNCS, pages 325--340, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. M. Majster-Cederbaum, M. Martens, and C. Minnameier. A Polynomial-Time-Checkable Sufficient Condition for Deadlock-freeness of Component Based Systems. In Proceedings of SOFSEM 07, volume 4362 of LNCS, pages 888--899, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. M. Majster-Cederbaum, M. Martens, and C. Minnameier. Liveness in Interaction Systems. In Proceedings of FACS'07, ENTCS, 2007.Google ScholarGoogle Scholar
  26. M. Majster-Cederbaum and C. Minnameier. Deriving Complexity Results for Interaction Systems from 1-safe Petri Nets. In Proceedings of SOFSEM'08, volume 4910 of LNCS, pages 352--363. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Majster-Cederbaum and C. Minnameier. Everything is PSPACE-complete in Interaction Systems, 2008. Accepted for Publication at ICTAC'08. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. M. Martens and M. Majster-Cederbaum. Deadlock-Freedom for Acyclic Component Architectures with Multiway Cooperation, 2008. submitted for publication.Google ScholarGoogle Scholar
  29. S. Moschoyiannis and M. Shields. Component-Based Design: Towards Guided Composition. In Proceedings ACSD'03, pages 122--131. IEEE Computer Society, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. O. Nierstrasz and F. Achermann. A Calculus for Modeling Software Components. In Proceedings of FMCO'02, volume 2852 of LNCS, pages 339--360, 2003.Google ScholarGoogle Scholar
  31. P. Parizek and F. Plasil. Modeling Environment for Component Model Checking from Hierarchical Architecture. In Proceedings of FACS'06, volume 182 of ENTCS, pages 139--153. Elsevier, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. J. Sifakis. Modeling Real-time Systems. In Proceedings of RTSS'04, pages 5--6. IEEE Computer Society, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. J. Sifakis. A Framework for Component-Based Construction. In Proceedings of SEFM'05, pages 293 -- 300. IEEE Computer Society, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Compositional analysis of deadlock-freedom for tree-like component architectures

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            EMSOFT '08: Proceedings of the 8th ACM international conference on Embedded software
            October 2008
            284 pages
            ISBN:9781605584683
            DOI:10.1145/1450058

            Copyright © 2008 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 19 October 2008

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate60of203submissions,30%

            Upcoming Conference

            ESWEEK '24
            Twentieth Embedded Systems Week
            September 29 - October 4, 2024
            Raleigh , NC , USA

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader