e/Marked graph

Information
has gloss	eng: 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: \forall p\in P: \|p\bullet\|=\|\bullet p\|=1. Marked graphs are used mostly to mathematically represent concurrently running operations, such as a multiprocessor machine's internal process state.
lexicalization	eng: Marked graph
instance of	e/Petri net

Media
media:img	Marked Graph example1.png