Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper provides Petri net (PN) modeling and performance analysis of a surface mount device (SMD) electronics manufacturing… 
2004
2004
The paper presents Gate Transfer Level (GTL) as a general framework for synthesis of industrial complexity asynchronous quasi… 
2004
2004
This note presents a control synthesis approach for discrete event systems modeled by marked graphs with unobservable transitions… 
Review
1999
Review
1999
Implicit places are a powerful tool inside Petri net theory, used in many design phases of a system. Firstly used as a reduction… 
1991
1991
This paper addresses the problem of state explosion and computational complexity in solving marked graph Stochastic Petri Nets… 
1989
1989
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is… 
1989
1989
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is…