# Petri Nets

> Model concurrent flow as places, tokens, and transitions, so reachability and deadlock are analyzable before runtime.

Record: `algorithms:petri-nets`
Kind: algorithm
Canonical: https://banes-lab.com/ontology/algorithms#algorithms-petri-nets
Closure: https://banes-lab.com/json/records/algorithms/petri-nets/closure

Listed in [Algorithm contracts](https://banes-lab.com/api/records/algorithms.md), after [Statecharts](https://banes-lab.com/records/algorithms/statecharts.md) and before [Queuing Theory](https://banes-lab.com/records/algorithms/queuing-theory.md).

## Domain

- [Architecture](https://banes-lab.com/records/algorithms-domain/architecture.md)

## Tier

- [leaf](https://banes-lab.com/records/vocabulary/domain-tier-leaf.md)

## Principle

- [Petri Nets](https://banes-lab.com/records/architecture/petri-nets.md)

## Composes

- [Concurrency Correctness](https://banes-lab.com/records/algorithms/concurrency-correctness.md)
- [Correctness Core](https://banes-lab.com/records/algorithms/correctness-core.md)

## Math type

- [Graph](https://banes-lab.com/records/reasoning/math-type-graph.md)

## Linked from

- [Transactions / State / Concurrency](https://banes-lab.com/ontology/principles/architecture-category-transactions-state-concurrency.md)
- [Architectural Clusters](https://banes-lab.com/ontology/algorithms/algorithms-domain-architectural-clusters.md)
- [The mathematics](https://banes-lab.com/ontology/reasoning/the-mathematics.md)
- [Domain tiers](https://banes-lab.com/ontology/schema/the-vocabulary-domain-tier.md)