26
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Symmetry Reduction for the Local Mu-Calculus

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Model checking large networks of processes is challenging due to state explosion. In many cases, individual processes are isomorphic, but there is insufficient global symmetry to simplify model checking. This work considers the verification of local properties, those defined over the neighborhood of a process. Considerably generalizing earlier results on invariance, it is shown that all local mu-calculus properties, including safety and liveness properties, are preserved by neighborhood symmetries. Hence, it suffices to check them locally over a set of representative process neighborhoods. In general, local verification approximates verification over the global state space; however, if process interactions are outward-facing, the relationship is shown to be exact. For many network topologies, even those with little global symmetry, analysis with representatives provides a significant, even exponential, reduction in the cost of verification. Moreover, it is shown that for network families generated from building-block patterns, neighborhood symmetries are easily determined, and verification over the entire family reduces to verification over a finite set of representative process neighborhoods.

          Related collections

          Most cited references21

          • Record: found
          • Abstract: not found
          • Article: not found

          Nonlinear dynamics of networks: the groupoid formalism

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Limits for automatic verification of finite-state concurrent systems

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Verifying properties of parallel programs: an axiomatic approach

                Bookmark

                Author and article information

                Journal
                25 March 2019
                Article
                1903.10405
                aafdb32b-aa3c-4106-8a05-ab2de193b060

                http://creativecommons.org/licenses/by/4.0/

                History
                Custom metadata
                TACAS (2) 2018: 379-395
                17 pages
                cs.LO

                Theoretical computer science
                Theoretical computer science

                Comments

                Comment on this article