Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
From MaRDI portal
Publication:2805419
DOI10.3233/FI-2015-1170zbMath1335.68177OpenAlexW1520212322MaRDI QIDQ2805419
Jeremias Weihmann, Ernst W. Mayr
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2015-1170
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Context-free commutative grammars with integer counters and resets, Flatness and Complexity of Immediate Observation Petri Nets
