Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities

DOI10.1007/978-3-642-41036-9_19zbMath1355.68194OpenAlexW176758562MaRDI QIDQ5168526

Jeremias Weihmann, Ernst W. Mayr

Publication date: 7 July 2014

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

Full work available at URL: http://mediatum.ub.tum.de/doc/1169599/document.pdf

Mathematics Subject Classification ID

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 (1)

A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application

This page was built for publication: Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities