Model checking EGF on basic parallel processes

DOI10.1007/978-3-642-24372-1_10zbMATH Open1348.68138OpenAlexW147847307MaRDI QIDQ3172909FDOQ3172909

Authors: Hongfei Fu 

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_10

Recommendations

• Bounded model checking liveness on basic parallel processes
• Model checking PA-processes
• Decidability of model checking with the temporal logic EF
• Model Checking CTL is Almost Always Inherently Sequential
• scientific article; zbMATH DE number 2080197

zbMATH Keywords

model checkinginfinite-state systemsbasic parallel processesEGF

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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 (1)

• Bounded model checking liveness on basic parallel processes

This page was built for publication: Model checking EGF on basic parallel processes

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