Every solution to Hw4 had a serious problem.
BPMN is not a flowcharting language.
Petri nets
π-calculus
Instead, it borrows its meanings from
Network analysis
Network Analysis
Monday, April 12, 2010
10:05 AM
Networks Page 1
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Network Analysis - Clouds and Power Aware Computing - Lecture Notes, Study notes of Computer Science
Main points of this lecture are: Network Analysis, Flowcharting Language, Petri Nets, Model of Parallel Computation, Petri Net Notation, Petri Sequences, Petri Net Tokens, Model of Execution, Petri Net Rules, Transition Nodes, Petri Net Constructions
Typology: Study notes
2012/2013
1 / 30
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Network Analysis - Clouds and Power Aware Computing - Lecture Notes and more Study notes Computer Science in PDF only on Docsity!
Every solution to Hw4 had a serious problem.
BPMN is not a flowcharting language.
Petri nets
π-calculus
Instead, it borrows its meanings from
Network analysis
Network Analysis
Monday, April 12, 2010 10:05 AM
Docsity.com
Some common BPMN weaknesses included:
Several impossible things before breakfast
Several impossible things before breakfast Monday, April 12, 2010 10:09 AM Docsity.com
Source nodes generate tokens.
Sink nodes eat tokens.
Transition nodes transform tokens in input to
tokens on output.
A general model of parallel computation based upon
token passing.
Consume input tokens
Generate (one or more) output tokens
Computation proceeds when tokens are available.
Petri nets
Petri nets
Monday, April 12, 2010 10:23 AM
Docsity.com
Places: can contain state. Notated by circles. Transitions: change state. Notated as bars. Petri Net Notation Example: Petri Net Notation Monday, April 12, 2010 10:35 AM Docsity.com
Model of execution: token passing Tokens are generated by sources, accumulate at places, and are consumed by transitions, generating new tokens. Petri net tokens Petri net tokens Monday, April 12, 2010 10:37 AM Docsity.com
Every place node must be connected only to transition nodes. Every transition node must be connected only to place nodes. Thus the Petri net is bipartite with two kinds of nodes. Petri net rules Petri net rules Monday, April 12, 2010 12:27 PM Docsity.com
Petri net constructions
Petri net constructions
Monday, April 12, 2010 11:03 AM Docsity.com
Message arrows and precedence arrows become
token arrows.
Start nodes become token sources.
End nodes become token sinks.
Implicit transition nodes become explicit.
A Petri model of BPMN
A Petri model of BPMN
Monday, April 12, 2010 10:26 AM
Docsity.com
Or, sorting things out a bit
Monday, April 12, 2010 2:24 PM Docsity.com
Petri Net Computation: start
Monday, April 12, 2010 2:24 PM Docsity.com
Petri Net Computation: after 2nd transition
Monday, April 12, 2010 2:24 PM Docsity.com
Petri Net Computation: after 3rd transition
Monday, April 12, 2010 2:24 PM Docsity.com
Petri Net Computation: finish
Monday, April 12, 2010 2:24 PM Docsity.com
There is a minor ambiguity in translating BPMN to Petri
Nets
A (minor) ambiguity
Monday, April 12, 2010 12:57 PM Docsity.com