Petri net | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

A Petri net, also known as a place/transition (PT) net, is one of several mathematical modeling languages for the description of distributed systems. It is a class of discrete event dynamic system. A Petri net is a directed bipartite graph that has two types of elements: places and transitions. Place elements are depicted as white circles and transition elements are depicted as rectangles. A place can contain any number of tokens, depicted as black circles. A transition is enabled if all places connected to it as inputs contain at least one token. Some sources state that Petri nets were invented in August 1939 by Carl Adam Petri—at the age of 13—for the purpose of describing chemical processes. Like industry standards such as UML activity diagrams, Business Process Model and Notation, and event-driven process chains, Petri nets offer a graphical notation for stepwise processes that include choice, iteration, and concurrent execution. Unlike these standards, Petri nets have an exac

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (75)

Related publications

Related people (1)

Related people

Related units (1)

Related units

Related concepts (27)

Related concepts

Related courses (4)

Related courses

Related lectures (6)

Related lectures

Business Process Model and Notation

Business Process Model and Notation (BPMN) is a graphical representation for specifying business processes in a business process model. Originally developed by the Business Process Management Initia

Concurrent computing

Concurrent computing is a form of computing in which several computations are executed concurrently—during overlapping time periods—instead of sequentially—with one completing before the next starts.

Concurrency (computer science)

In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This

Well-structured Petri Nets extensions with data

Rémi Bonnet

Well-structured transitions systems (WSTS) are a general class of infinite state systems for which decidability results rely on the existence of a well-quasi-ordering that is compatible with the transitions. Many models can be seen as WSTS : lossy counter machines, lossy channel systems, string rewrite systems are for example WSTS. Petri Nets are another famous model that can be seen as a WSTS. Since the introduction of Petri nets, many extensions have been proposed, most of them being well-structured. One of the recent ones are data nets, that subsumes almost all already proposed extensions. The focus of our work was to try to find the limits of data nets, and to try to distinguish them from other extensions. As a secondary goal, we wanted to provide an alternate representation of data nets to ease the comprehension of this model.

2010

Using the COOPN/2 Formal Method for Groupware Systems Engineering

COOPN/2 (Concurrent Object Oriented Petri Nets) is an object-oriented specification formalism based on Petri Nets and algebraic specifications. It is fully adapted to the specification of complex concurrent systems because it inherits the advantages of algebraic specifications for the specification of abstract data types, from Petri nets to describe partially ordered events and from the object-oriented paradigm for the 'structuring' of the specification. All these features are especially useful when speaking about groupware systems, which are application which demand rich modeling capabilities on concurrency and structuring. This paper explains the major principles for the specification of groupware systems with COOPN/2. This is done by mapping groupware concepts into COOPN/2 concepts and is demonstrated by means of an example of shared distributed diaries. Furthermore, we present the work done on the methodological approach for the development of concurrent object-oriented systems with COOPN/2 which cover analysis, specification, design, prototyping and testing. groupware, replication, object-orientation, distributed systems, formal methods, Petri Nets, algebraic specification of abstract data types, software engineering. Keywords : groupware, replication, object-orientation, distributed systems, formal methods, Petri Nets, algebraic specification of abstract data types, software engineering.

1996

Perspectives in the Use of Coloured Petri Nets for Risk Analysis and Accident Modelling

David Vernez

2003

CS-487: Industrial automation

This course consists of two parts:

architecture of automation systems, hands-on lab
handling of faults and failures in real-time systems, including fault-tolerant computing

MGT-707: Product lifecycle management - concepts methods and tools

The course "Product Lifecycle Management - concepts methods and tools" studies the concept and application of product lifecycle management over the whole product lifecycle.

CS-452: Foundations of software

The course introduces the foundations on which programs and programming languages are built. It introduces syntax, types and semantics as building blocks that together define the properties of a program part or a language. Students will learn how to apply these concepts in their reasoning.