Reachability for finite-state process algebras using static analysis

DOI10.1007/978-3-642-24288-5_20zbMATH Open1348.68170DBLPconf/rp/SkrypnyukN11OpenAlexW2128219805WikidataQ59416336 ScholiaQ59416336MaRDI QIDQ3172877FDOQ3172877

Authors: Nataliya Skrypnyuk, Flemming Nielson 

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

Recommendations

• Reachability for finite-state process algebras using Horn clauses
• scientific article; zbMATH DE number 4039302
• Symbolic Reachability for Process Algebras with Recursive Data Types
• Static analysis of IMC
• A logical reconstruction of reachability

zbMATH Keywords

reachabilityprocess algebrastatic analysis

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Static analysis of IMC
• Symbolic Reachability for Process Algebras with Recursive Data Types
• Reachability for finite-state process algebras using Horn clauses
• Static analysis for state-space reductions preserving temporal logics
• Reachability Analysis with State-Compatible Automata
• Title not available (Why is that?)

This page was built for publication: Reachability for finite-state process algebras using static analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172877)