Termination Properties of Generalized Petri Nets

DOI10.1137/0205020MaRDI QIDQ4098653zbMATH OpenOpenAlexFDO

Authors Y. Edmund Lien

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205020

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(14)

• On the reversibility of circular conservative Petri nets
• Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm
• Complexity of some problems in Petri nets
• A tabular method for the analysis of large petri nets
• Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions
• Analysis of petri nets by partitioning: splitting places or transitions
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
• A sufficient condition for the liveness of weighted event graphs
• The unsolvability of some Petri net language problems
• Periodic schedules for linear precedence constraints
• Execution termination and computation determinacy of data-flow program nets
• On the reversibility of well-behaved weighted choice-free systems
• Analysis of Petri nets by partitioning: Splitting transitions
• Analysis of structural properties of Petri nets based on product incidence matrix

This page was built for publication: Termination Properties of Generalized Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4098653)