| http://dbpedia.org/ontology/abstract
|
An augmented marked graph is basically a P … 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 where every cycle is marked. For each resource place, there are pairs of outgoing and incoming transitions connected by elementary paths.transitions connected by elementary paths.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Amg_wiki_example.jpg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
54023783
|
| http://dbpedia.org/ontology/wikiPageLength
|
1085
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1013601912
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Concurrency_%28computer_science%29 +
, http://dbpedia.org/resource/Petri_net +
, http://dbpedia.org/resource/Industrial_engineering +
, http://dbpedia.org/resource/Liveness +
, http://dbpedia.org/resource/Category:Formal_specification_languages +
, http://dbpedia.org/resource/Category:Models_of_computation +
, http://dbpedia.org/resource/Marked_graph +
, http://dbpedia.org/resource/Category:Petri_nets +
, http://dbpedia.org/resource/File:Amg_wiki_example.jpg +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Orphan +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Concurrency_%28computer_science%29 +
, http://dbpedia.org/resource/Category:Models_of_computation +
, http://dbpedia.org/resource/Category:Petri_nets +
, http://dbpedia.org/resource/Category:Formal_specification_languages +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Augmented_marked_graph?oldid=1013601912&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Amg_wiki_example.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Augmented_marked_graph +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q30715955 +
, http://dbpedia.org/resource/Augmented_marked_graph +
, https://global.dbpedia.org/id/2quXj +
|
| rdfs:comment |
An augmented marked graph is basically a P … 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 where every cycle is marked. For each resource place, there are pairs of outgoing and incoming transitions connected by elementary paths.transitions connected by elementary paths.
|
| rdfs:label |
Augmented marked graph
|
