Knowra Petri net Petri net A Petri net is a mathematical model of concurrent systems built from places, transitions, and tokens. Its structure represents possible events, while token movement represents changing system states.
Place/transition net : A Petri net whose places hold indistinguishable tokens and whose transitions move them between places. This standard form gives the basic places, tokens, and transitions their operational meaning.
Directed bipartite graph : A directed graph whose vertices divide into two sets, with edges running only between the sets. Petri-net arcs connect places to transitions or transitions to places, never like to like.
Workflow : A sequence or network of tasks through which work and information pass. Places and transitions can represent task conditions, work items, and handoffs.
Carl Adam Petri : A German mathematician and computer scientist who introduced Petri nets in his 1962 dissertation. His dissertation established the model and its central account of concurrent events.
Finite-state machine : A computational model with a finite set of states and transitions triggered by inputs. Unlike a basic finite-state machine, a Petri net can represent independent concurrent activity compactly.
Marking (Petri net) : An assignment of token counts to the places of a Petri net. A marking records the net’s current state before and after transitions fire.
Multiset : A collection in which an element may occur more than once. A place’s marking is a multiset of tokens, or a count when tokens are indistinguishable.
Manufacturing system : An organized process that transforms materials into products using people, machines, and procedures. Token counts can model parts, machine availability, and concurrent production steps.
Petri’s dissertation : Carl Adam Petri’s 1962 dissertation, which introduced the mathematical foundations of Petri nets. It framed the original problem of describing communication between discrete components.
Process algebra : A family of algebraic formalisms for describing and reasoning about interacting processes. Process algebras emphasize compositional behavior where Petri nets emphasize state and resource flow.
Show all 27