Generating Petri Net State Spaces

Wolf, Karsten

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

Cited by 58 publications

(27 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The resulting BPMN model is then transformed into a WF-net according to the mapping defined in [24]. For such a WF-net, we checked soundness using LoLA [25]. A BPMN model is classified as being perspicuous if the respective WF-net is sound; otherwise, it is classified as non-perspicuous.…”

Section: We Operationalize the Definition Of A Perspicuous Model Asmentioning

confidence: 99%

Tying Process Model Quality to the Modeling Process: The Impact of Structuring, Movement, and Speed

Claes

Vanderfeesten

Reijers

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.In an investigation into the process of process modeling, we examined how modeling behavior relates to the quality of the process model that emerges from that. Specifically, we considered whether (i) a modeler's structured modeling style, (ii) the frequency of moving existing objects over the modeling canvas, and (iii) the overall modeling speed is in any way connected to the ease with which the resulting process model can be understood. In this paper, we describe the exploratory study to build these three conjectures, clarify the experimental set-up and infrastructure that was used to collect data, and explain the used metrics for the various concepts to test the conjectures empirically. We discuss various implications for research and practice from the conjectures, all of which were confirmed by the experiment.

show abstract

Section: We Operationalize the Definition Of A Perspicuous Model Asmentioning

confidence: 99%

Tying Process Model Quality to the Modeling Process: The Impact of Structuring, Movement, and Speed

Claes

Vanderfeesten

Reijers

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We still deal primarily with CP-nets, and the embedding of PTnets is just that, an embedding, which means we do not do any of the advanced analysis facilitated by looking at low-level nets, such as advanced state-space analysis as performed by LoLA [18], stochastic/timed analysis as performed by GreatSPN [5], or symmetry reduction as performed by CPN-AMI [11]. Adding Declare constraints is interesting as it provides Declare models with data (from the CP-nets) and provides CP-nets with a new description of control-flow at at higher level, making it easier to step-wise refinement by focusing on abstract control flow first, and add concrete control flow and data as necessary.…”

Section: Discussionmentioning

confidence: 99%

“…Handling packages received for communication patterns 1 and 2 is done by implementing a handle method (ll. [18][19][20][21][22]). An extension says it wants to intercept packages using pattern 1 by subscribing to them (ll.…”

Section: ¦ ¥mentioning

confidence: 99%

CPN Tools 4: Multi-formalism and Extensibility

Westergaard

2013

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. CPN Tools is an advanced tool for editing, simulating, and analyzing colored Petri nets. This paper discusses the fourth major release of the tool, which makes it simple to use the tool for ordinary Petri nets, including adding inhibitor and reset arcs, and PNML export. This version also supports declarative modeling using constraints, and adds an extension framework making it easy for third parties to extend CPN Tools using Java.

show abstract

“…Additionally, fixing a number k, we used the state-of-the art Petri net model checker LoLA [19] to both establish a lower bound, by querying LoLA for existence of a reachable marking M with conc(M ) ≥ k; and to establish an upper bound, by querying LoLA if all reachable markings M satisfy conc(M ) ≤ k.…”

Section: Concurrency Threshold: a Practical Approachmentioning

confidence: 99%

Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets

Meyer

Esparza

Völzer

2018

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Workflow graphs extend classical flow charts with concurrent fork and join nodes. They constitute the core of business processing languages such as BPMN or UML Activity Diagrams. The activities of a workflow graph are executed by humans or machines, generically called resources. If concurrent activities cannot be executed in parallel by lack of resources, the time needed to execute the workflow increases. We study the problem of computing the minimal number of resources necessary to fully exploit the concurrency of a given workflow, and execute it as fast as possible (i.e., as fast as with unlimited resources).We model this problem using free-choice Petri nets, which are known to be equivalent to workflow graphs. We analyze the computational complexity of two versions of the problem: computing the resource and concurrency thresholds. We use the results to design an algorithm to approximate the concurrency threshold, and evaluate it on a benchmark suite of 642 industrial examples. We show that it performs very well in practice: It always provides the exact value, and never takes more than 30 ms for any workflow, even for those with a huge number of reachable markings.

show abstract

Generating Petri Net State Spaces

Cited by 58 publications

References 31 publications

Tying Process Model Quality to the Modeling Process: The Impact of Structuring, Movement, and Speed

Tying Process Model Quality to the Modeling Process: The Impact of Structuring, Movement, and Speed

CPN Tools 4: Multi-formalism and Extensibility

Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets

Contact Info

Product

Resources

About