Formula-dependent equivalence for compositional CTL model checking

DOI10.1023/A:1016043502772zbMATH Open1019.68064OpenAlexW1520559746WikidataQ57380746 ScholiaQ57380746MaRDI QIDQ698104FDOQ698104

Authors Adnan Aziz, Vigyan Singhal, Thomas R. Shiple, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli

Publication date 18 September 2002

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016043502772

zbMATH Keywords

bisimulationcompositional minimizationCTL model checking

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Compositional model checking of product-form CTMCs
• A compositional approach to CTL\(^*\) verification
• Parameterized compositional model checking
• scientific article; zbMATH DE number 4180789
• scientific article; zbMATH DE number 1796131
• Compositional and quantitative model checking (extended abstract)
• LTL-model-checking via model composition
• Quantified CTL: expressiveness and model checking (extended abstract)
• The complexity of model checking for circumscriptive formulae

Cited in

(1)

• Reduced models for efficient CCS verification

This page was built for publication: Formula-dependent equivalence for compositional CTL model checking

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