Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems

Ehrig, Hartmut; Hoffmann, Kathrin; Padberg, Julia; Prange, Ulrike; Ermel, Claudia

doi:10.1007/978-3-540-73094-1_9

Cited by 31 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover these activities can be interleaved. In [11] we have continued our work by transferring the results of local Church-Rosser which are well known for term rewriting and graph and net transformations (see [30,7,10]) to the consecutive evolution of a P/T-system by token firing and rule applications. In more detail, we assume that a given P/T-system represents a certain system state.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Petri Net Transformations

Ehrig¹,

Hoffmann²,

Padberg³

et al. 2008

Petri Net, Theory and Applications

Self Cite

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

“…In [11,17,10] we have transferred these results to place/transition systems, where a place/transition system is a place/transition net with an initial marking. Coloured Petri nets [18,19,20] are high-level nets combining P/T nets and ML expressions for data type definitions.…”

Section: Further Resultsmentioning

confidence: 99%

Petri Net Transformations

Ehrig¹,

Hoffmann²,

Padberg³

et al. 2008

Petri Net, Theory and Applications

Self Cite

View full text Add to dashboard Cite

“…net transformation [15,3], where under suitable conditions transformation steps can be performed in any order leading to the same result. In [6] we have transferred these results, so that net transformations and token firing can be executed in arbitrary order provided that certain conditions are satisfied. Further ongoing work concerns the correspondence between these different concepts of independence in more detail and transfer these results to highlevel net processes.…”

Section: Conclusion and Related Workmentioning

confidence: 96%

“…This enables the modeling of flexible workflows in manets and supports changes of the network topology and the subsequent transformation of workflows. Algebraic higher-order (AHO) nets are Petri nets with complex tokens, especially reconfigurable place/transition (P/T) nets in [6]. AHO-nets can be considered as a special case of algebraic high-level (AHL) nets.…”

Section: Introductionmentioning

confidence: 99%

Composition and Independence of High-Level Net Processes

Ehrig

Hoffmann

Gabriel

et al. 2009

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Mobile ad-hoc networks (manets) are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure. To model workflows in manets adequately a formal technique is given by algebraic higher-order nets. For this modeling technique we here present a high-level net process semantics and results concerning composition and independence. Based on the notion of processes for low-level Petri nets we analyse in this paper high-level net processes defining the non-sequential behaviour of high-level nets. In contrast to taking low-level processes of the well known flattening construction for high-level nets our concept of high-level net processes preserves the high-level structure. The main results are the composition, equivalence and independence of high-level net processes under suitable conditions. Independence means that they can be composed in any order leading to equivalent high-level net processes which especially have the same input/output behaviour. All concepts and results are explained with a running example of a mobile ad-hoc network in the area of a university campus.

show abstract

“…A representative of this category is the "nets within nets" paradigm, introduced by Valk [21], that gave rise to special High-Level PNs such as [11]. As for PNs with indistinguishable tokens, we have to mention Reconfigurable PN, a family of PN-based formalisms consisting of a marked net and a separated set of net-transformation rules specified according to the classical, algebraic style of Graph Transformations Systems (as a double pushout) [9,12,8,10,18]. Most research has focused on trying to formulate these models as M -adhesive categories.…”

Section: Introductionmentioning

confidence: 99%

A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

Capra

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Petri Nets (PN) are a central, theoretically sound model for concurrent or distributed systems but, at least in their classical definition, not expressive enough to represent dynamic reconfiguration capabilities. On the other side, Rewriting Logic has proved to be a natural semantic framework for several formal models of concurrent/distributed systems. We propose a compact, efficient Maude formalization of dynamically reconfigurable PT nets (with inhibitor arcs), using as a running example the specification of a simple, fault-tolerant manufacturing system. We discuss the advantages of such a combined approach, as well as some concerns that it raises.

show abstract

Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems

Cited by 31 publications

References 23 publications

Petri Net Transformations

Petri Net Transformations

Composition and Independence of High-Level Net Processes

A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

Contact Info

Product

Resources

About