Assume-Guarantee Verification for Distributed Systems with Local Specifications

We investigate assume-guarantee reasoning for global specifications consisting of conjunctions of local specifications. We present a sound and complete assume-guarantee rule that permits reasoning about individual modules for local specifications and draws conclusions about global specifications of distributed systems. We illustrate our approach with an example from the field of network congestion control, where different agents are responsible for controlling packet flow across a shared infrastructure. In this context, we derive a sound assume-guarantee rule for system stability, and show that this rule is valuable to reason about any number of agents, any initial flow configuration, and any topology of bounded degree.

[1]  Howard Barringer,et al.  Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning , 2008, Formal Methods Syst. Des..

[2]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[3]  Mahesh Viswanathan,et al.  Foundations for Circular Compositional Reasoning , 2001, ICALP.

[4]  Yih-Kuen Tsay,et al.  GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae , 2007, TACAS.

[5]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[6]  Howard Barringer,et al.  Assumption generation for software component verification , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[7]  Rajeev Alur,et al.  Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition , 2006, ATVA.

[8]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[9]  Howard Barringer,et al.  Proof Rules for Automated Compositional Verification through Learning , 2003 .

[10]  Yih-Kuen Tsay,et al.  Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages , 2008, TACAS.

[11]  Alessio Lomuscio,et al.  Model Checking Optimisation-Based Congestion Control Models , 2009 .

[12]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[13]  Corina S. Pasareanu,et al.  Automated Assume-Guarantee Reasoning by Abstraction Refinement , 2008, CAV.

[14]  Rajeev Alur,et al.  Automatic symbolic compositional verification by learning assumptions , 2008, Formal Methods Syst. Des..