Compressing transitions for model checking

DOI10.1007/3-540-45657-0_48MaRDI QIDQ4804926zbMATH OpenFDO

Authors Hüsnü Yenigün, R. P. Kurshan, V. A. Levin

Publication date 1 May 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2404/24040569.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• From states to transitions: Improving translation of LTL formulae to Büchi automata
• scientific article; zbMATH DE number 910719
• Refining and compressing abstract model checking
• Operation caching and state compression for model checking of high-level models. How to have your cake and eat it
• Optimizing Büchi automata

Cited in

(4)

• Out of control: reducing probabilistic models by control-state elimination
• Operation caching and state compression for model checking of high-level models. How to have your cake and eat it
• scientific article; zbMATH DE number 1069481 (Why is no real title available?)
• scientific article; zbMATH DE number 1418459 (Why is no real title available?)

This page was built for publication: Compressing transitions for model checking

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