A petri net interpretation of open reconfigurable systems - Archive ouverte HAL
Journal Articles Fundamenta Informaticae Year : 2013

A petri net interpretation of open reconfigurable systems

Abstract

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.
No file

Dates and versions

hal-00819095 , version 1 (30-04-2013)

Identifiers

Cite

Frédéric Peschanski, Hanna Klaudel, Raymond Devillers. A petri net interpretation of open reconfigurable systems. Fundamenta Informaticae, 2013, 122 (1-2), pp.85--117. ⟨10.3233/FI-2013-784⟩. ⟨hal-00819095⟩
121 View
0 Download

Altmetric

Share

More