A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

  • Authors:

  • Roland Meyer;Victor Khomenko;Tim Strazny

  • Affiliations:

  • Department of Computing Science, University of Oldenburg, Oldenburg, Germany D-26129;School of Computing Science, University of Newcastle, Newcastle upon Tyne, U.K. NE1 7RU;Department of Computing Science, University of Oldenburg, Oldenburg, Germany D-26129

  • Venue:
  • PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a technique for verification of mobilesystems. We translate finite control processes,which area well-known subset of Π-Calculus, into Petri nets,which are subsequently used for model checking. This translationalways yields bounded Petri nets with a small bound, and we developa technique for computing a non-trivial bound by static analysis.Moreover, we introduce the notion of safe processes,whichare a subset of finite control processes, for which our translationyields safe Petri nets, and show that every finite control processcan be translated into a safe one of at most quadratic size. Thisgives a possibility to translate every finite control process intoa safe Petri net, for which efficient unfolding-based verificationis possible. Our experiments show that this approach has asignificant advantage over other existing tools for verification ofmobile systems in terms of memory consumption and runtime.