scientific article; zbMATH DE number 2242597

zbMath1087.68609MaRDI QIDQ5714450

No author found.

Publication date: 2 January 2006

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2215/22150385.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

TSO-to-TSO linearizability is undecidable ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems ⋮ Verifying lossy channel systems has nonprimitive recursive complexity.