---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Thomas
      foaf_name: Wies, Thomas
      foaf_surname: Wies
      foaf_workInfoHomepage: http://www.librecat.org/personId=447BFB88-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Damien
      foaf_name: Zufferey, Damien
      foaf_surname: Zufferey
      foaf_workInfoHomepage: http://www.librecat.org/personId=4397AC76-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-3197-8736
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  bibo_doi: 10.1007/978-3-642-12032-9_8
  bibo_volume: 6014
  dct_date: 2010^xs_gYear
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Forward analysis of depth-bounded processes@
...