Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

DOI10.1007/978-3-540-77050-3_44zbMATH Open1135.68481OpenAlexW1536576409MaRDI QIDQ5458863FDOQ5458863

Authors: Matthias Schmalz, Daniele Varacca, H. Völzer 

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/69252

Recommendations

• Modalities for model checking: Branching time logic strikes back
• scientific article; zbMATH DE number 2196601
• Model checking with strong fairness
• The tractability of model checking for LTL: the good, the bad, and the ugly fragments
• Weak Kripke structures and LTL

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• The complexity of probabilistic verification
• The complexity of propositional linear temporal logics
• Title not available (Why is that?)
• Modalities for model checking: Branching time logic strikes back
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• Title not available (Why is that?)
• Once upon a time in the West. Determinacy, definability, and complexity of path games
• Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

Cited In (5)

• Fairness modulo theory: a new approach to LTL software model checking
• Model checking a path (preliminary report)
• Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
• Model checking with strong fairness
• \(\infty\)-regular temporal logic and its model checking problem

This page was built for publication: Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

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