Browse by author
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.
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.
Author(s): Meyer R, Khomenko V, Strazny T
Editor(s): van Hee, K.M., Valk, R.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Applications and Theory of Petri Nets: 29th International Conference
Year of Conference: 2008
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Notes: Selected as one of best papers of ATPN 2008.
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science