An Upper Bound for the Reachability Problem of Safe, Elementary Hornets
From MaRDI portal
Publication:2968854
DOI10.3233/FI-2016-1305zbMath1358.68215MaRDI QIDQ2968854
Michael Köhler-Bußmeier, Frank Heitmann
Publication date: 22 March 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication: An Upper Bound for the Reachability Problem of Safe, Elementary Hornets