Category: Petri nets

Marked graph
A marked graph is a Petri net in which every place has exactly one incoming arc, and exactly one outgoing arc. This means, that there can not be conflict, but there can be concurrency. Mathematically:
Multiple buffering
In computer science, multiple buffering is the use of more than one buffer to hold a block of data, so that a "reader" will see a complete (though perhaps old) version of the data, rather than a parti
Algebraic Petri net
An algebraic Petri net (APN) is an evolution of the well known Petri net in which elements of user defined data types (called algebraic abstract data types (AADT)) replace black tokens. This formalism
Well-formed Petri net
Well-formed Petri nets are a Petri net class jointly elaborated between the University of Paris 6 (Université P. & M. Curie) and the University of Torino in the early 1990s. It is a restriction of the
CPN-AMI
CPN-AMI is a computer-aided software engineering environment based on Petri Net specifications. It provides the ability to specify the behavior of a distributed system—and to evaluate properties such
Nets within Nets
Nets within Nets is a modelling method belonging to the family of Petri nets.This method is distinguished from other sorts of Petri nets by the possibility to provide their tokens with a proper struct
Coloured Petri net
Coloured Petri nets are a backward compatible extension of the mathematical concept of Petri nets. Coloured Petri nets preserve useful properties of Petri nets and at the same time extend the initial
Augmented marked graph
An augmented marked graph is basically a Petri net with a specific set of places called resource places. If removing these resource places and their associated arcs, it will become a marked graph wher
Carl Adam Petri
Carl Adam Petri (12 July 1926 in Leipzig – 2 July 2010 in Siegburg) was a German mathematician and computer scientist.
Petri Net Markup Language
Petri Net Markup Language (PNML) is an interchange format aimed at enabling Petri net tools to exchange Petri net models. PNML is an XML-based syntax for , which is being designed as a standard interc
Vector addition system
A vector addition system (VAS) is one of several mathematical modeling languages for the description of distributed systems. Vector addition systems were introduced by Richard M. Karp and Raymond E. M
Stochastic Petri net
Stochastic Petri nets are a form of Petri net where the transitions fire after a probabilistic delay determined by a random variable.
Prioritised Petri net
A Prioritised Petri net is a structure (PN, Π) where PN is a Petri net and Π is a priority function that maps transitions into non-negative natural numbers representing their priority level The enable
Petriscript
PetriScript is a modeling language for Petri nets, designed by Alexandre Hamez and Xavier Renault. The CPN-AMI platform provides many tools to work on Petri nets, such as verifying and model-checking
Slicing Petri nets
Petri net (PN) slicing is a syntactic technique used to reduce a PN model based on a given criterion. Informally, a slicing criterion could be a property for which a PN model is analyzed or is a set o
Maria (reachability analyzer)
Maria: The Modular Reachability Analyzer is a reachability analyzer for concurrent systems that uses (a high-level variant of Petri nets) as its modelling formalism.
Dualistic Petri nets
Dualistic Petri nets (dPNs) are a process-class variant of Petri nets.Like Petri nets in general and many related formalisms and notations, they are used to describe and analyze process architecture.
Architecture Design and Assessment System
The Architecture Design and Assessment System (ADAS) was a set of software programs offered by the Research Triangle Institute from the mid-1980s until the early 1990s. A petri net-like graph model of
CO-OPN
The CO-OPN (Concurrent Object-Oriented Petri Nets) specification language is based on both algebraic specifications and algebraic Petri nets formalisms. The former formalism represent the data structu
Petri net
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