Toggle Main Menu Toggle Search

Open Access padlockePrints

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Lookup NU author(s): Dr Victor Khomenko



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.

Publication metadata

Author(s): Meyer R, Khomenko V, Strazny T

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2008

Pages: 32

Print publication date: 01/01/2008

Source Publication Date: January 2008

Report Number: 1064

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne