Marked graph
id:
marked-graph-280-14108944
title:
Marked graph
text:
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: ∀ p ∈ P : | p ∙ | = | ∙ p | = 1 . Marked graphs are used mostly to mathematically represent concurrently running operations, such as a multiprocessor machine's internal process state. This class of Petri nets gets the name from a popular way of representing them: as a graph where each place is an e
brand slug:
wiki
category slug:
encyclopedia
description:
Specific type of Petri net
original url:
https://en.wikipedia.org/wiki/Marked_graph
date created:
date modified:
2024-02-17T23:28:24Z
main entity:
{"identifier":"Q6770617","url":"https://www.wikidata.org/entity/Q6770617"}
image:
fields total:
13
integrity:
14