Discrete-event models
part 3: modelling with
Dr. Bystrov
School of Engineering Newcastle University
Copyright By PowCoder代写 加微信 powcoder
Discrete-event modelspart 3: modelling with
PN building blocks: Fork-join
“Fork” starts concurrent processes. Increases concurrency.
“Join” synchronises concurrent processes. Reduces concurrency
Combined fork-join.
Synchronises concurrent processes. Generates new concurrency.
Less synchronisation ⇒ more freedom ⇒ faster system! Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
Pipeline model
What is a pipeline (First In – First Out, FIFO) Difference between a pipeline and a shift register Behavioural model of a linear pipeline ( t)
“full” states
“empty” states
Discrete-event modelspart 3: modelling with
PN building blocks: choice
Free choice
usually represents the lack of knowledge about its mechanism;
often takes place in the environment. Controlled choice
the control mechanism is known and represented in the model;
can be implemented as a device. Arbitration
Buridan’s Ass problem [Aristotle];
can be implemented as a device. Confusion (we are not going to use it. . . )
should be refined for implementation.
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
crititcal section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
pending ME
Asynchronous arbiter model
critical section
Discrete-event modelspart 3: modelling with
Pipeline Petri net example Choice-merge
Arbiter Petri net example
Next: Examples of constructing Petri net models
Discrete-event modelspart 3: modelling with
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com