Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs

Padberg, Julia

doi:10.1007/978-3-319-21145-9_7

Cited by 4 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many workflow languages rely on Petri nets [2,4]. Priority flow in Petri net-based process models is managed with the help of inhibitor arcs and transition priorities [31]. Inhibitor arcs allow a transition to fire only if the adjacent place is empty.…”

Section: Related Workmentioning

confidence: 99%

Service Orchestration with Priority Constraints

Changizi¹,

Kokash

Arbab

2019

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Business process management is an operational management approach that focuses on improving business processes. Business processes, i.e., collections of important activities in an organization, are represented in the form of a workflow, an orchestrated and repeatable pattern of activities amenable to automated analysis and control. Priority is an important concept in modeling workflows. We need priority to model cancelable and compensable tasks within transactional business processes. We use the Reo coordination language to model and formally analyze workflows. In this paper, we propose a constraint-based approach to formalize priority in Reo. We introduce special channels to propagate and block priority flows, define their semantics as constraints, and model priority propagation as a constraint satisfaction problem.

show abstract

Section: Related Workmentioning

confidence: 99%

Service Orchestration with Priority Constraints

Changizi¹,

Kokash

Arbab

2019

Fundamentals of Software Engineering

View full text Add to dashboard Cite

show abstract

“…4. We can combine subtyping of labels even with transition priorities (see [Pad15]). A category of labelled partial orders, where the partial order is independent of the order of the labeling, is the basis and can be proven to be M-adhesive.…”

Section: Proofmentioning

confidence: 99%

“…In [Pad15] the category of partial ordered sets poSets where the objects are partially orders sets and the morphisms are order-preserving maps, that are maps f : A → B preserving the order, so a ≤ a implies f (a) ≤ f (a ). Here, we use for the name space partial ordered sets with a greatest element g and the additional condition that f (g) = g.…”

Section: Construction Of the Name Space For Hierarchical Reconfigurab...mentioning

confidence: 99%

See 1 more Smart Citation

Subtyping for Hierarchical, Reconfigurable Petri Nets

Padberg

2018

Preprint

Self Cite

View full text Add to dashboard Cite

Hierarchical Petri nets allow a more abstract view and reconfigurable Petri nets model dynamic structural adaptation. In this contribution we present the combination of reconfigurable Petri nets and hierarchical Petri nets yielding hierarchical structure for reconfigurable Petri nets. Hierarchies are established by substituting transitions by subnets. These subnets are themselves reconfigurable, so they are supplied with their own set of rules. Moreover, global rules that can be applied in all of the net, are provided.

show abstract

“…2. The classical Petri Nets are not expressive enough and often are extended (e.g., with colors [11], reset and inhibitor arcs [12], priority [13,14] transitions) to enable meaningful process analysis. Such extensions change the semantics of the model and generate incompatible dialects of process-specification languages adopted by various tools.…”

Section: Introductionmentioning

confidence: 99%