{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:50Z","timestamp":1751429450044,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"3-4","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,7]]},"abstract":"<jats:p>We propose a technique for verification of mobile systems. We\n\t\t\t translate finite control processes, a well-known subset of \u03c0-Calculus, into\n\t\t\t Petri nets, which are subsequently used formodel checking. This translation\n\t\t\t always yields bounded Petri nets with a small bound, and we develop a technique\n\t\t\t for computing a non-trivial bound by static analysis. Moreover, we introduce\n\t\t\t the notion of safe processes, a subset of finite control processes, for which\n\t\t\t our translation yields safe Petri nets, and show that every finite control\n\t\t\t process can be translated into a safe one of at most quadratic size. This gives\n\t\t\t a possibility to translate every finite control process into a safe Petri net,\n\t\t\t for which efficient unfolding-based verification is possible. Our experiments\n\t\t\t show that this approach has a significant advantage over other existing tools\n\t\t\t for verification of mobile systems in terms of memory consumption and runtime.\n\t\t\t We also demonstrate the applicability of our method on a realistic model of an\n\t\t\t automated manufacturing system.<\/jats:p>","DOI":"10.3233\/fi-2009-138","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T03:52:27Z","timestamp":1575345147000},"page":"439-471","source":"Crossref","is-referenced-by-count":6,"title":["A Practical Approach to Verification of Mobile Systems Using Net\t\t\t Unfoldings"],"prefix":"10.1177","volume":"94","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[{"name":"Department of Computing Science, University of\r\t\t\t Oldenburg. D-26129 Oldenburg, Germany. E-mail:\r\t\t\t {Roland.Meyer,Tim.Strazny}@informatik.uni-oldenburg.de"}]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[{"name":"School of Computing Science, Newcastle University,\r\t\t\t Newcastle upon Tyne, NE1 7RU, U.K. E-mail: Victor.Khomenko@ncl.ac.uk"}]},{"given":"Tim","family":"Strazny","sequence":"additional","affiliation":[{"name":"Department of Computing Science, University of\r\t\t\t Oldenburg. D-26129 Oldenburg, Germany. E-mail:\r\t\t\t {Roland.Meyer,Tim.Strazny}@informatik.uni-oldenburg.de"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-138","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:50:12Z","timestamp":1751367012000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["10.3233\/FI-2009-138"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-138","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}