Forward analysis of depth-bounded processes

  • Authors:

  • Thomas Wies;Damien Zufferey;Thomas A. Henzinger

  • Affiliations:

  • IST Austria (Institute of Science and Technology Austria);IST Austria (Institute of Science and Technology Austria);IST Austria (Institute of Science and Technology Austria)

  • Venue:
  • FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems.