Publication:2851063
From MaRDI portal
zbMath1272.68309MaRDI QIDQ2851063
Publication date: 2 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S157106610505200X
68Q25: Analysis of algorithms and problem complexity
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Bisimilarity on basic parallel processes