Termination Properties of Generalized Petri Nets
From MaRDI portal
Publication:4098653
DOI10.1137/0205020zbMath0332.68037OpenAlexW2090740917MaRDI QIDQ4098653
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items (13)
Execution termination and computation determinacy of data-flow program nets ⋮ Analysis of petri nets by partitioning: splitting places or transitions ⋮ A tabular method for the analysis of large petri nets ⋮ The unsolvability of some Petri net language problems ⋮ Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions ⋮ A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application ⋮ On the Reversibility of Well-Behaved Weighted Choice-Free Systems ⋮ Unnamed Item ⋮ Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm ⋮ Complexity of some problems in Petri nets ⋮ Periodic schedules for linear precedence constraints ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Analysis of Petri nets by partitioning: Splitting transitions
This page was built for publication: Termination Properties of Generalized Petri Nets
