A symbolic procedure for control reachability in the asynchronous -calculus (extended abstract)

zbMATH Open1271.68179MaRDI QIDQ2847412FDOQ2847412

Authors: Giorgio Delzanno 

Publication date: 9 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104050534

Recommendations

• scientific article; zbMATH DE number 1809622
• On the decidability of fragments of the asynchronous \(\pi\)-calculus
• scientific article; zbMATH DE number 1512624
• scientific article; zbMATH DE number 1223739
• scientific article; zbMATH DE number 1104400

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Multiset rewriting for the verification of depth-bounded processes with name binding
• Title not available (Why is that?)
• On the decidability of fragments of the asynchronous \(\pi\)-calculus
• An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes

This page was built for publication: A symbolic procedure for control reachability in the asynchronous \(\pi\)-calculus (extended abstract)

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