Analysis of Dynamic Communicating Systems by Hierarchical Abstraction

We propose a new abstraction technique for verifying topology prop- erties of dynamic communicating systems (DCS), a special class of infinite-state systems. DCS are characterized by unbounded creation and destruction of objects along with an evolving communication connectivity or topology. We employ a lightweight graph transformation system to specify DCS. Hierarchical Abstrac- tion computes a bounded over-approximation of all topologies that can occur in a DCS directly from its transformation rules. Hierarchical Abstraction works in two steps. First, for each connected component, called cluster, of a topology, objects sharing a common property are summarized to one abstract object. Then isomor- phic abstract connected components are summarized to one abstract component, called abstract cluster. This yields a conservative approximation of all graphs that may occur during any DCS run. The technique is implemented.

[1]  B. König,et al.  Verifying Finite-State Graph Grammars: An Unfolding-Based Approach , 2004, CONCUR.

[2]  Sonia R. Sachs,et al.  Design Of Platoon Maneuver Protocols For IVHS , 1991 .

[3]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[4]  Annegret Habel,et al.  Relabelling in Graph Transformation , 2002, ICGT.

[5]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[6]  Ahmed Bouajjani,et al.  Abstract Regular Model Checking , 2004, CAV.

[7]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.

[8]  Dániel Varró,et al.  Model Checking Graph Transformations: A Comparison of Two Approaches , 2004, ICGT.

[9]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[10]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[11]  Rajeev Alur,et al.  Computer Aided Verification: 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings , 2004, CAV 2004.

[12]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[13]  Ugo Montanari,et al.  Unfolding and Event Structure Semantics for Graph Grammars , 1999, FoSSaCS.

[14]  Paolo Baldan,et al.  A Logic for Analyzing Abstractions of Graph Transformation Systems , 2003, SAS.

[15]  Arend Rensink,et al.  Graph Grammar Verification through Abstraction , 2005 .

[16]  Arend Rensink,et al.  Canonical Graph Shapes , 2004, ESOP.

[17]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[18]  Reiko Heckel,et al.  Compositional Verification of Reactive Systems Specified by Graph Transformation , 1998, FASE.