@inproceedings{4361,
  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.},
  author       = {Wies, Thomas and Zufferey, Damien and Henzinger, Thomas A},
  editor       = {Ong, Luke},
  location     = {Paphos, Cyprus},
  pages        = {94 -- 108},
  publisher    = {Springer},
  title        = {{Forward analysis of depth-bounded processes}},
  doi          = {10.1007/978-3-642-12032-9_8},
  volume       = {6014},
  year         = {2010},
}