Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: pi-calculus

Sortuj według:

Ogranicz wyniki do:

A Petri Net Interpretation of Open Reconfigurable Systems

Peschanski F., Klaudel H., Devillers R.

Fundamenta Informaticae

2013

Vol. 122, nr 1-2

85--117

We present a Petri net interpretation of the pi-graphs - a graphical variant of the picalculus where recursion and replication are replaced by iteration. The concise and syntax-driven translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated high-level Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the translated Petri nets, most notably a guarantee of finiteness by construction.

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Meyer R., Khomenko V., Strazny T.

Fundamenta Informaticae

2009

Vol. 94, nr 3/4

4439-471

We propose a technique for verification of mobile systems. We translate finite control processes, a well-known subset of π-Calculus, into Petri nets, which are subsequently used formodel 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.

Investigating the Logical Aspects of the Pi-calculus

Bernard N.

Schedae Informaticae

2003

Vol. 12

57-66

The relations between the p-calculus and logic have been less extensively studied than for the l-calculus. We give an account on what can be found in the literature, in two distinct directions: model-checking, and typing. We propose a Curry-Howard correspondence taking into account the dynamic properties of the p-calculus. This is a first presentation of a work in progress.