Reachability for finite-state process algebras using Horn clauses
DOI10.1142/S0129054113400121zbMATH Open1295.68169DBLPjournals/ijfcs/SkrypnyukN13OpenAlexW2101393622WikidataQ51540658 ScholiaQ51540658MaRDI QIDQ2842001FDOQ2842001
Flemming Nielson, Nataliya Skrypnyuk
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113400121
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
This page was built for publication: Reachability for finite-state process algebras using Horn clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842001)
