A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems

Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. Deciding the existence of deadlocks is NP-hard as it involves global state analysis. We present here a parametrized polynomial-time algorithm that is able to confirm deadlock-freedom for a certain class of interaction systems. The discussion includes characteristic examples and displays the role of the parameter of the algorithm.

[1]  Somesh Jha,et al.  Exploiting Symmetry In Temporal Logic Model Checking , 1993, CAV.

[2]  Paul C. Attie,et al.  Synthesis of concurrent systems with many similar processes , 1998, TOPL.

[3]  Marc Geilen.  Non-Exhaustive Model-Checking in Component Based Systems , 2000 .

[4]  Jaikumar Radhakrishnan,et al.  FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science , 2004, Lecture Notes in Computer Science.

[5]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[6]  Christoph Minnameier.  Deadlock-Detection in Component-Based Systems is NP-hard. , 2006 .

[7]  Andrew S. Tanenbaum,et al.  Modern Operating Systems , 1992 .

[8]  Alessandro Aldini,et al.  A General Approach to Deadlock Freedom Verification for Software Architectures , 2003, FME.

[9]  Amir Pnueli,et al.  Parameterized Verification with Automatically Computed Inductive Assertions , 2001, CAV.

[10]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[11]  Andrew S. Tanenbaum,et al.  Modern operating systems, 2nd Edition , 2001 .

[12]  Stefania Gnesi,et al.  FME 2003: Formal Methods: International Symposium of Formal Methods Europe, Pisa, Italy, September 8-14, 2003. Proceedings , 2003, Lecture Notes in Computer Science.

[13]  Joseph Sifakis,et al.  An Approach to Modelling and Verification of Component Based Systems , 2007, SOFSEM.

[14]  Hana Chockler,et al.  Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs , 2005, VMCAI.

[15]  Joseph Sifakis,et al.  Component-Based Construction of Deadlock-Free Systems: Extended Abstract , 2003, FSTTCS.

[16]  Joseph Sifakis,et al.  Composition for component-based modeling , 2002, Sci. Comput. Program..

[17]  Joseph Sifakis.  A framework for component-based construction , 2005, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05).

[18]  梅村 恭司.  Andrew S.Tanenbaum 著, "Operating systems, Design and implementation", PRENTICE-HALL, INC., Englewood Cliffs, B5変形判, 719p., \4,120 , 1988 .