Multiset rewriting for the verification of depth-bounded processes with name binding

  • Authors:

  • Fernando Rosa-Velardo;María Martos-Salgado

  • Affiliations:

  • Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Facultad de Informática, C/Prof. José García Santesmases, s/n, 28040 Madrid, Spain;Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Facultad de Informática, C/Prof. José García Santesmases, s/n, 28040 Madrid, Spain

  • Venue:
  • Information and Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We combine two of the existing approaches to the study of concurrency by means of multiset rewriting: multiset rewriting with existential quantification (MSR) and constrained multiset rewriting. We obtain @n-MSR, where we rewrite multisets of atomic formulae, in which terms can only be pure names, where some names can be restricted. We consider the subclass of depth-bounded @n-MSR, for which the interdependence of names is bounded. We prove that they are strictly Well Structured Transition Systems, so that coverability, termination and boundedness are all decidable for depth-bounded @n-MSR. This allows us to obtain new verification results for several formalisms with name binding that can be encoded within @n-MSR, namely polyadic @n-PN (Petri nets with tuples of names as tokens), the @p-calculus, MSR or Mobile Ambients.