Marked graph

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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Article history: Received 13 June 2014 Available online xxxx 
  • figure 4
  • figure 5
Is this relevant?
2013
2013
This paper presents a unified framework for the Infinitesimal Perturbation Analysis (IPA) gradientestimation technique in the… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Petri net is a mathematical model for discrete event systems. Batch processing arcs are suggested which moves all tokens in its… (More)
  • figure 1
  • table I
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2007
2007
Augmented marked graphs possess some structural characteristics which are desirable for modelling shared-resource systems. This… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
2005
2005
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2004
2004
erved Augmented marked graphs were first introduced Chu [1]. Based on siphons and mathematical progr ming, Chu found a number of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper addresses the forbidden-state problem of general marked graphs with uncontrollable transitions. The models need not to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1995
1995
The analysis of stochastic marked graphs is considered. The underlying idea is to decompose the marked graph into subnets, to… (More)
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Is this relevant?
1992
1992
A class of synchronized queueing networks with deterministic routing is identiied to be equivalent to a subclass of timed Petri… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in… (More)
Is this relevant?