Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,298,470 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Petri net
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Productivity analysis of an electronics re-manufacturing system through stochastic Petri nets and artificial neural networks
Ali Mehmet
,
F. Ismail
2011
Corpus ID: 15415721
This paper provides Petri net (PN) modeling and performance analysis of a surface mount device (SMD) electronics manufacturing…
Expand
2004
2004
Automated Pipelining in ASIC Synthesis Methodology : Gate Transfer Level
A. Smirnov
,
A. Taubin
,
M. Karpovsky
2004
Corpus ID: 6595296
The paper presents Gate Transfer Level (GTL) as a general framework for synthesis of industrial complexity asynchronous quasi…
Expand
2004
2004
Supervisory control of partially observable marked graphs
Z. Achour
,
N. Rezg
,
Xiaolan Xie
IEEE Transactions on Automatic Control
2004
Corpus ID: 1586783
This note presents a control synthesis approach for discrete event systems modeled by marked graphs with unobservable transitions…
Expand
Review
1999
Review
1999
Implicit places in net systems
F. García-Vallés
,
J. Colom
Proceedings 8th International Workshop on Petri…
1999
Corpus ID: 45475321
Implicit places are a powerful tool inside Petri net theory, used in many design phases of a system. Firstly used as a reduction…
Expand
Highly Cited
1993
Highly Cited
1993
Petri Net Supervisors for Generalized Mutual Exclusion Constraints
A. Giua
,
F. DiCesare
,
Manuel Silva
1993
Corpus ID: 67296353
1991
1991
Iterative Decomposition and Aggregation of Stochastic Marked Graph Petri Nets
Yao Li
,
C. Woodside
Applications and Theory of Petri Nets
1991
Corpus ID: 4015392
This paper addresses the problem of state explosion and computational complexity in solving marked graph Stochastic Petri Nets…
Expand
1989
1989
Tight polynomial bounds for steady-state performance of marked graphs
J. Campos
,
G. Chiola
,
J. Colom
,
M. Suárez
Proceedings of the Third International Workshop…
1989
Corpus ID: 7254085
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is…
Expand
1989
1989
Properties and steady-state performance bounds for Petri nets with unique repetitive firing count vector
J. Campos
,
G. Chiola
,
M. Suárez
Proceedings of the Third International Workshop…
1989
Corpus ID: 5472101
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is…
Expand
1985
1985
Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets
J. Magott
Information Processing Letters
1985
Corpus ID: 3716778
1980
1980
Relevance of network theory to models of distributed/parallel processing☆
T. Murata
1980
Corpus ID: 58302982
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE