Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities

DOI10.3233/FI-2016-1318MaRDI QIDQ2968528zbMATH OpenOpenAlexFDO

Authors Ernst W. Mayr, Jeremias Weihmann

Publication date 16 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1318

zbMATH Keywords

equivalenceboundednessreachabilitycoveringcontainmentlivenessgeneral Petri netsgeneralized Petri netsarbitrary arc multiplicitiesarbitrary edge multiplicitiesgeneral arc multiplicitiesgeneral edge multiplicitiesgeneralized communication-free Petri netsgeneralized S-systemsjoin-free Petri netsweighted state machines

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
• Complexity results for problems of communication-free Petri nets and related formalisms
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
• scientific article; zbMATH DE number 1354143
• scientific article; zbMATH DE number 4037227

Cited in

(4)

• Completeness results for single-path Petri nets
• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
• Context-free commutative grammars with integer counters and resets
• Complexity results for problems of communication-free Petri nets and related formalisms

This page was built for publication: Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities

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