Completeness results for single-path Petri nets

DOI10.1006/INCO.1993.1055MaRDI QIDQ690244zbMATH OpenOpenAlexFDO

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

Publication date 6 May 1994

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c695f8267c17957a1b85d415fa35ae7e5bcfd20b

zbMATH Keywords

persistent Petri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Completeness results for linear logic on Petri nets
• scientific article; zbMATH DE number 176140
• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
• Compositional reachability in Petri nets
• scientific article; zbMATH DE number 5506906
• The completeness of linear logic for Petri net models
• Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• scientific article; zbMATH DE number 1515282

Cited in

(4)

• The complexity of problems involving structurally bounded and conservative Petri nets
• Bounded self-stabilizing Petri nets
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
• scientific article; zbMATH DE number 176140 (Why is no real title available?)

This page was built for publication: Completeness results for single-path Petri nets

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