Appunti per l'esame di Process and Service Design

MULTIPLE A

MI PRIORI

WITH

WITOUT

INSTANCE A

MI PRIORI

WITH MI A

WITHOUT PRIORI

NCURONIZATION

5) DESIGN TIME-UNOW CEDGE OWN-TIME RUN-TIME

CEDGE

UNOW UNOWLEDGE

with

the

Some but

grevious one

· ,

different #instancesi

sarahonization

instance

multiple a

created, MI costant

be

con DF

- : a

with e

expressiona

MI

mo RT on vi

- :

ssuchenization which

Coffer end

Last

the volu t

is mars

tivity

Lofte stat)

Last

the =

endled

au

patter is

violated

sequence come Assumen mondanization #instances

the mave

is not

indicate fot be

while mmming

an

- nated

be

instances can

new activity

install that

manament

a

- their end

defines

DEFERRED WITHOUT

SEQUENTIAL EXECUTION

MOKE UNOWLEDGE

PRIORI DESION TIME MILESTONE CANCEL ACTIVIT intirotal

B instances

of

set withdrows

ended

activity tore is it

an

an if

also

B executed sequentially stated

endled

is

A already

has

- its first disabled

> execution

C It's

- en if

andet

ne mileston the .

cumently

possible

2 a where instance

running

and

2

> 2

A & has ben

C ,

,

- semoved

halted and

withat

a time reached in

e

a e expiring

D

Just the

1 andering not

is

defined

choice unete e n If the application simple

DB in

mode DB

a

un

based Stated

- sistem

transaction quarantee

He

the management

DB

on environment the ,

choice

,

deloyed that

os late

is befor the

restored

posible the to state

is the

as DB

other

(the bracks then snipped

ore rection the activity

of instance

CANCEL CASE

complete instance

or executive

proces (with its

all gentune

in ands

removed unently

and recorded

and

all the

toses hoving completed

sub-proced unacesfully

as

in

PETRI NETS INTRODUCTION

: forandina

Netudo

don busines

Pet

of

workflow net se n

= transition

that conscend

of to

geneic piece

TASH more

= a transition

enabled

tone specific enabled

to

for

R : conepads

case

com a an

,

actual item

of

execution to fining

coneonds the

mork

ACTHR transition

a

= , S semantic

quathically

octivities The

busines of

found

expened Not

WorkFrow busines

WHs in in

NET Petri

proces

a poss

= o n a .

The semantice

fornd of and

nots

busines independent

progeties

andysis

allows vender

Peti is

the

for

process expressed of

in proces

because seuerd busines toos

management band Petri

porn mets

ore on

developed additional

the to

sistems vaients espects

model

by the

Adam allows modeling

in Som

Cal

60s Petri

PETRI concument distributed assistianous ore

NETS of

= , ·

,

,

Terrand Cland bipartite

The

and aiented

Stockestic auophConnectina

PN (elements

transitions structure

define

are places

, that the net

and of

. Tosse

behaviou net

of the

the a

define .

A Petri N

Net triple where

(P F)

is + :

a . ,

P fond

set

finite places

of

=

- finite set

T transitions

of

- =

FC relation

flow

(PXTV TXP)

- =

fiven Petri Net :

a and transitions

postsets for

defined

Pre-sets be

and places :

con

- fe

met

↳ plapidefined

ter

l portset for place defined

a SET (P

is

p

↳ HEF3

os p

= ,

for

postset transition t defined SPEPIC

a Ho

is as IP) F

+

= determine state

described Petri

the

by the

ELNAVIOUR betonens and of Net

the eperested

of met Nomine or .

moming

= is

.

fire Petri N <P

Net f)

+ :

= ,

e ,

PAN

m :

- tonem

number of

pEP m(P)

poe

to eoch a

esique

woming

- the 3 pEP1mcpc

set M

- :

An initial to be

Mo specified

needs

moring endled Apert

Net

Peti if

transition

ENABLED tet

N is

TRANSITIONS mip)o

in

IP making

f)

given n

a + a

=

= a ,

, ,

WEIGHT FUNCTION (PXTIUCTXP) EN

= :

W (x EF

if

3)

w(x ! 5)

0

=

- , , EF

w(X if

3) (x b)

0

=

- j

, , Net

If ordinary

the Petri

Peti named

Net is

the

then

rage 20

of 23

is

w .

FIRING TRANSITION PetriNet

moring of (PITIE)

N nabled it

gives transaction when

and hoppers

fine

M

= and

a

a = mas :

,

torn of

for the

rach imput

unald places

is

a

- tonen poduad for

is each

a the

of autut places

- I

Formal Net

Petri N F)

= T

P

given :

a enabled

· in

, t

if

transaction

, M

is

the the weight fine

function

and ET

curt can

M a

moning ~

- ,

the FpEP

to

of

finime wher

yields

+ M'

- mi (P) ) p)

+ +,

w(p w(

new m(p)

a moning +

= -

NON , cimultaneously

for but not

DETERMINISM endled

then cold fined

given them be

moking be

= of

and

a transition

one

mor m a r can ,

Finime and

transition cannot

action interneted

that be

instantaneously

atomic

is

a an acus

REACHABCE Petri Net and state

MARKING Me:

(P F)

given

= T

a a

i

. state

state

transition enabled firmat

Ma[tM2 t and

Mr Mr

Ma results

in

: in

is in

a

- that

+

transition such

Me2 Ma

My

Mr there

- > It

is

: a to state (i

state Mn MaltMa[tzMu

Mz2F]Mn [ta]Ma

tr bods

the from

th

ti Ma

Mr

firma sequence U

: e

- ...

= ...., .

. ,

,

A there

state finima

Mr if

reachable only that Mi

and =ta

is from if is [C

ta

sequence th

Me such

a ...

, ,

empty

An Mr[E)

allowed

do Me

fining is

sequence XpeP mi p

A MoMi

Petri Net markings

BOUNDNess rochable :

initial exh

for .

No

N with

CPIT -bonded

is if

making

FI

= = ,

Petri

the

18 sol

Net

n

SAFE PETRINET in

e

= = , sabled transition

This the

property that

such

M' that is hanes

from there t

LIVE iff

transition reachable marina

TRANSITION M

live is

markina

is .

was

= a

a become

diaps nabled

can opain

sofenen finite state space

a

the

livenes obsence deadlocks

of if

line

Petri Net

LIVE FtET live

tis

is

NET or ,

= draps

that transition

Peti

offer noch

Liveness endled.

met

for

termination exclude where

Termination holds

each

and making no is

a

.

A Petri finite

terminating reachability

Net (i finite and aydic

grath

if the

is is

every is

un e .

.

BUSINESS PROCESS PETRI NETS

SOUNDNESS VERIFICATION WITH

PETRI NETS AND AUSINESS PROCESSES

Concert

PETRI EP

NET CONCEPT

Place State activiti/event

Atomic

Transition litem

instance

Tonen onder etc

abzeit e I

julted pros

↳

mani a , ...

Moring Smeechot of instance

proten

a S

mitid instance

state

nitial of pocen

a

marking actività

Enabled event

transition Exeertable /

Fining the

stee of

Execution erder

A

rochability guash repentina possible

Transition executions the

Sistem all of proon

PATTERNS

WORKFLOW PETRI NET

WITH

SPLIT SaN

And

A

O M

se

Xor

vor

XoR D

a

evento

PETRI NETS BPMN

AND MAPPING

: PETRI

PETRI NET NET

APMN APMN

PETRI NET

APMN o ·

Il

- #

- X

En

START T

i

TASK

>

- L D

Il

E-

D - m

-

D =>

=

#

* there

Not

Petri

NET where

WOrrFa isi

= als initia place

one

- anles find plar

an

- to the

initial find place

the place

not the

Nome poth

of the for

modes

- in

ore

Defined called The to

the wouldow

basic for

Adot theer

the ai

the

von put

↳ is

WOMC

in so

des .

& ,

identify what done

similaly

morflows

good in DBMS

to set

torn stated

-A -

DEFINITONS place that he

the not

I mon poten

on

= triminated

A token place the

that hes

o proce

come

an

- the

A within

tonen the other decument poes

of poss requents

- on a

one

Not condet

referents

wF-net

every busines protes

a

beadhous

- activities

activated

never

-

-eindos wormets

identify

Soundres (it indipenden

allow

property and

conect busines domain

to is

processes

no

PROCESS

BUSINESS PROPERTIES Structure Soundres

: - sorriden

-

wean se

sentende

sande

structurally

structural sound

Soundness if

Busines Proces :

is

a

= ther initial

exactly without

mode edges

is (the only

mode incoming

- only

one

-the is exactly find oulgaine

one without

nade edges

(the os

mode

only

Each the mode

initial mode

mode the fina

to

poth

model

in

- the

from

it

proven an a

this

To pepeto denived

wify the the be

from WF-net

PN must

busines proces a

, eventually it

when

CF-net ther

the

is hegen

round will and

SOUNDNESS procedure terminate

for in

tenen

if

O case

= an s a

,

,

all the offer

place'd' and este. Fondly

places :