Single-path Petri nets

DOI10.1007/3-540-54345-7_63MaRDI QIDQ4035241zbMATH OpenFDO

Authors Rodney R. Howell, Louis E. Rosier, Petr Jančar

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_63

zbMATH Keywords

canonical analysis problemssingle-path Petri nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Completeness results for single-path Petri nets
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
• Complexity results for 1-safe-nets
• A Note on Persistent Petri Nets
• Petri nets with simple circuits

Cited in

(2)

• Linear time analysis of properties of conflict-free and general Petri nets
• Completeness results for single-path Petri nets

This page was built for publication: Single-path Petri nets

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