Overview of Reconfigurable Petri Nets

Padberg, Julia; Kahloul, Laïd

doi:10.1007/978-3-319-75396-6_11

Cited by 22 publications

(14 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, new extensions of this formalism were introduced to distinguish concurrent and dynamic systems by suggesting various enhancements of the basic Petri net model (Llorens & Oliver, 2004b;Badouel et al, 2003). In this context, Padberg and Kahloul (2018) classified reconfigurable Petri nets into three types: reconfigurable low-level nets, reconfigurable stochastic nets, and reconfigurable high-level nets. In addition, it is argued in the literature that various reconfigurable Petri nets approaches can be classified into three principal classes: rewriting net systems-based approaches, graph transformation-based approaches, and hybrid approaches.…”

Section: Literature Reviewmentioning

confidence: 99%

Comprehensive Framework-Based Reconfigurable Object Nets for Managing Dynamic Protocols Evolution

Hamli

Chaoui

Elmansouri

et al. 2023

International Journal of Organizational and Collective Intelligence

View full text Add to dashboard Cite

In the change management context, handling web service evolution is a challenging issue that aims to adapt deployed business processes to the perpetual changes occurring in enterprises environments. While existing approaches deal with the problem by focusing only on migratable instances, in this approach the authors propose a paradigm shift based on reconfigurable objects nets (RONs) to allow running service instances continuing their execution according to the evolved protocol specifications. In this approach, service protocols are modelled as petri nets, and changes are perceived as transformation rules. Further, reachability graphs are deployed for calculating migratable services instances after evolution. The conceived framework allows migrating active instances from the old protocol version to the evolved one. Web service protocol compatibility and replaceability aspects are addressed to distinguish migratable services instances from non-migratable ones. The authors illustrate their contribution and highlight advantages of using RONs through a real-world scenario related to the visa application service.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Comprehensive Framework-Based Reconfigurable Object Nets for Managing Dynamic Protocols Evolution

Hamli

Chaoui

Elmansouri

et al. 2023

International Journal of Organizational and Collective Intelligence

View full text Add to dashboard Cite

show abstract

“…Recongurability using rewriting rules has also been studied for Petri nets (see [23] for an overview). In the general case, recongurable Petri nets do not preserve properties such as liveness, boundedness, or reversibility.…”

Section: Related Workmentioning

confidence: 99%

RDF: A Reconfigurable Dataflow Model of Computation

Fradet

Girault

Krishnaswamy

et al. 2022

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Dataflow Models of Computation (MoCs) are widely used in embedded systems, including multimedia processing, digital signal processing, telecommunications, and automatic control. In a dataflow MoC, an application is specified as a graph of actors connected by FIFO channels. One of the first and most popular dataflow MoCs, Synchronous Dataflow (SDF), provides static analyses to guarantee boundedness and liveness, which are key properties for embedded systems. However, SDF and most of its variants lacks the capability to express the dynamism needed by modern streaming applications. In particular, the applications mentioned above have a strong need for reconfigurability to accommodate changes in the input data, the control objectives, or the environment. We address this need by proposing a new MoC called Reconfigurable Dataflow (RDF). RDF extends SDF with transformation rules that specify how and when the topology and actors of the graph may be reconfigured. Starting from an initial RDF graph and a set of transformation rules, an arbitrary number of new RDF graphs can be generated at runtime. A key feature of RDF is that it can be statically analyzed to guarantee that all possible graphs generated at runtime will be consistent and live. We introduce the RDF MoC, describe its associated static analyses, and present its implementation and some experimental results.

show abstract

“…It is generally accepted that (classical) PN are instances of GTS, due to the lack of ability to adapt/reconfigure their structure. Some PN extensions have been thus equipped with dynamical reconfiguration capabilities (a survey may be found in [13]), which, however, almost always build on concepts typical of Graph Transformation Rules.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A structural approach to graph transformation based on symmetric Petri nets

Capra

2021

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Graph Transformation Systems (GTS) and Petri Nets (PN) are two central, theoretically sound, formal models for concurrent or distributed systems. A lot of papers have focused on the relationship between GTS and PN. It is generally accepted that PN are instances of GTS due to the lack of ability to adapt or reconfigure their structure. In this paper, which extends a recent one, we reverse this perspective by presenting a formal definition of GTS in terms of Symmetric Nets (SN). SN are a standard High-Level PN formalism featuring a compact syntax which highlights behavioural symmetries of systems. The major strength lies in the possibility of using well-established tools to edit/efficiently analyze (SN-based) graph transformation models. We follow a structural approach, based on a newly implemented symbolic calculus, to validate Graph Transformation Rules (GTR) and formally verify GTS properties.In the second part of the paper, we supply a semantic characterization of the SN-based graph transformation model, by carrying out a thorough comparison with the classical, algebraic double-pushout (DPO) approach. We constructively and formally show how to translate any DPO rule to a corresponding, elementary or composite, SN rule. We treat both injective and non-injective DPO rules/rule matches. The comparison shows that the SN approach is, in some sense, a generalization of the DPO.

show abstract

Overview of Reconfigurable Petri Nets

Cited by 22 publications

References 51 publications

Comprehensive Framework-Based Reconfigurable Object Nets for Managing Dynamic Protocols Evolution

Comprehensive Framework-Based Reconfigurable Object Nets for Managing Dynamic Protocols Evolution

RDF: A Reconfigurable Dataflow Model of Computation

A structural approach to graph transformation based on symmetric Petri nets

Contact Info

Product

Resources

About