scientific article; zbMATH DE number 1929958
From MaRDI portal
Publication:4708592
zbMath1014.68103MaRDI QIDQ4708592
Publication date: 18 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200433.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 (5)
Characteristic invariants in Hennessy-Milner logic ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ Unnamed Item ⋮ A general approach to comparing infinite-state systems with their finite-state specifications
This page was built for publication:
