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


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


We propose a technique for verification of mobile systems. We translate finite control processes, 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, 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. We also demonstrate the applicability of our method on a realistic model of an automated manufacturing system.

Publication metadata

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

Publication type: Article

Publication status: Published

Journal: Fundamenta Informaticae

Year: 2009

Volume: 94

Issue: 3-4

Pages: 439-471

ISSN (print): 0169-2968

ISSN (electronic): 1875-8681

Publisher: IOS Press


DOI: 10.3233/FI-2009-138

Notes: Special Issue on Best Papers from ATPN'08.


Altmetrics provided by Altmetric


Find at Newcastle University icon    Link to this publication