Reachability for Finite-State Process Algebras Using Static Analysis

DOI10.1007/978-3-642-24288-5_20zbMath1348.68170OpenAlexW2128219805WikidataQ59416336 ScholiaQ59416336MaRDI QIDQ3172877

Flemming Nielson, Nataliya Skrypnyuk

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_20

zbMATH Keywords

reachabilityprocess algebrastatic analysis

Mathematics Subject Classification ID

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

Related Items (1)

Static analysis of IMC

This page was built for publication: Reachability for Finite-State Process Algebras Using Static Analysis