On ACTL formulas having linear counterexamples

DOI10.1006/JCSS.2000.1734MaRDI QIDQ5943101zbMATH OpenOpenAlexWikidataFDO

Authors Francesco Buccafurri, Thomas Eiter, Georg Gottlob, N. Leone

Publication date 9 September 2001

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/55d385cc34408a375d4cdea20817e918325a84bd

zbMATH Keywords

ACTL formulabranching time logicsmodel checkingtemporal reasoning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Linear templates of ACTL formulas with an application to SAT-based verification
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Correct Hardware Design and Verification Methods
• Optimal proofs for linear temporal logic on lasso words
• On relative and probabilistic finite counterability

Cites work

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Enhancing model checking in verification by AI techniques
• scientific article; zbMATH DE number 438994 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 910719 (Why is no real title available?)

Cited in

(4)

• Producing explanations for rich logics
• Linear templates of ACTL formulas with an application to SAT-based verification
• CTL update of Kripke models through protections
• Formal Techniques for Networked and Distributed Systems – FORTE 2004

This page was built for publication: On ACTL formulas having linear counterexamples

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