A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Meyer, R; Khomenko, V; Strazny, T

doi:10.1007/978-3-540-68746-7_22

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

In this paper we propose a technique for verification of mobile systems. We translate finite control processes, which are a well-known subset of pi-Calculus, into Petri nets, which are subsequently used for model checking. This translation always yields bounded Petri nets with a small bound, and we develop a technique for computing a non-trivial bound by static analysis. Moreover, we introduce the notion of safe processes, which are a subset of finite control processes, for which our translation yields safe Petri nets, and show that every finite control process can be translated into a safe one of at most quadratic size. This gives a possibility to translate every finite control process into a safe Petri net, for which efficient unfolding-based verification is possible. Our experiments show that this approach has a significant advantage over other existing tools for verification of mobile systems in terms of memory consumption and runtime.