Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities
DOI10.3233/FI-2016-1318zbMath1357.68140OpenAlexW2314356162MaRDI QIDQ2968528
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
equivalencecoveringboundednessreachabilitylivenesscontainmentgeneral Petri netsgeneralized Petri netsarbitrary arc multiplicitiesarbitrary edge multiplicitiesgeneral arc multiplicitiesgeneral edge multiplicitiesgeneralized communication-free Petri netsgeneralized S-systemsjoin-free Petri netsweighted state machines
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items