Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Marked_graph> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Marked_graph abstract "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: . 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 edge and each transition is a node.".
- Marked_graph thumbnail Marked_Graph_example1.png?width=300.
- Marked_graph wikiPageID "5708400".
- Marked_graph wikiPageRevisionID "600920864".
- Marked_graph hasPhotoCollection Marked_graph.
- Marked_graph subject Category:Petri_nets.
- Marked_graph type Artifact100021939.
- Marked_graph type ComputerNetwork103085333.
- Marked_graph type Instrumentality103575240.
- Marked_graph type Internet103580615.
- Marked_graph type Network103820728.
- Marked_graph type Object100002684.
- Marked_graph type PetriNets.
- Marked_graph type PhysicalEntity100001930.
- Marked_graph type System104377057.
- Marked_graph type Whole100003553.
- Marked_graph comment "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: . Marked graphs are used mostly to mathematically represent concurrently running operations, such as a multiprocessor machine's internal process state.".
- Marked_graph label "Marked graph".
- Marked_graph sameAs m.0f0ck3.
- Marked_graph sameAs Q6770617.
- Marked_graph sameAs Q6770617.
- Marked_graph sameAs Marked_graph.
- Marked_graph wasDerivedFrom Marked_graph?oldid=600920864.
- Marked_graph depiction Marked_Graph_example1.png.
- Marked_graph isPrimaryTopicOf Marked_graph.