Modelling and Analysis Mobile Systems Using $$\pi $$ -calculus (EFCP)

Abstract

Abstract. Reference passing systems, like mobile and reconfigurable systems are common nowadays. The common feature of such systems is the possibility to form dynamic logical connections between the individual modules. However, such systems are very difficult to verify, as their logical structure is dynamic. Traditionally, decidable fragments of π-calculus, e.g. the well-known Finite Control Processes (FCP), are used for formal modelling of reference passing systems. Unfortunately, FCPs allow only 'global' concurrency between processes, and thus cannot naturally express scenarios involving 'local' concurrency inside a process, such as multicast. In this paper we propose Extended Finite Control Processes (EFCP), which are more convenient for practical modelling. Moreover, an almost linear translation of EFCPs to FCPs is developed, which enables efficient model checking of EFCPs.

Analysing Petri Nets in a Calculus of Context-Aware Ambients

“…In particular, in [15], the theory of bigraphs has been applied to C/E nets, by converting C/E nets to bigraphs and examining their behavioural theory. Moreover, there has been a significant work on translating process algebras to Petri nets [20]; with application to the verification of mobile systems [21]. For instance, [17], [18] proposed a translation of CCS into Petri nets, while [19] presented a distributed semantics for π-calculus, based on Petri nets.…”