Structural symbolic CTL model checking of asynchronous systems.

DOI10.1007/B11831MaRDI QIDQ5900669zbMATH OpenOpenAlexFDO

Authors Gianfranco Ciardo, Radu I. Siminiceanu

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11831

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Symbolic CTL model checking of asynchronous systems using constrained saturation
• scientific article; zbMATH DE number 2102715
• Symbolic model checking: \(10^{20}\) states and beyond
• scientific article; zbMATH DE number 1507203
• scientific article; zbMATH DE number 1696452

Cited in

(7)

• Exploiting interleaving semantics in symbolic state-space generation
• scientific article; zbMATH DE number 1696452 (Why is no real title available?)
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• Checking bounded reachability in asynchronous systems by symbolic event tracing
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• scientific article; zbMATH DE number 2102715 (Why is no real title available?)
• Model Checking Software

Describes a project that uses

Uses Software

• NuSMV

This page was built for publication: Structural symbolic CTL model checking of asynchronous systems.

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