Welcome to our new site version. Your web page bookmarks may have changed, please search for pages by title to update them. Having problems ? Please try clearing your web browser cache and hard-reloading your web page first before contacting our webmaster.

The Petri Net Method

[document] Submitted on 4 June, 2019 - 18:08
Keywords petri net method transitions petri net net petri method
Standards groups

A transition is firable or enabled when there are sufficient tokens in its input places.After firing, tokens will be transferred from the input places (old state) to the output places, denoting the new state. Note that the EFTPOS example is a Petri net representation of a finite state machine (FSM).

A producer-consumer system, consist of one producer, two consumers and one storage buffer with the following conditions:
The storage buffer may contain at most 5 items;
The producer sends 3 items in each production;
At most one consumer is able to access the storage buffer at one time;
Each consumer removes two items when accessing the storage buffer

Metadata
Date published
1962
Document type
presentation
Pages
41
Replaced/Superseded by document(s)
Cancelled by
Amended by
File MIME type Size (KB) Language Download
petri.ppt application/vnd.ms-powerpoint   618 KB English DOWNLOAD!
File attachments
Cover images
Introduction

First introduced by Carl Adam Petri in 1962.
A diagrammatic tool to model concurrency and synchronization in distributed systems.
Very similar to State Transition Diagrams.
Used as a visual communication aid to model the system behaviour.
Based on strong mathematical foundation.

Author(s)
Dr Chris Ling
Defines standard
Visit also