scientific article; zbMATH DE number 2080931
From MaRDI portal
Publication:4474001
zbMath1052.68093MaRDI QIDQ4474001
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2234/22340326.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (2)
A connection between concurrency and language theory ⋮ Component simulation-based substitutivity managing QoS and composition issues
This page was built for publication:
