REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES
From MaRDI portal
Publication:2842001
DOI10.1142/S0129054113400121zbMath1295.68169OpenAlexW2101393622WikidataQ51540658 ScholiaQ51540658MaRDI QIDQ2842001
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
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) 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