On two-sided approximate model-checking: Problem formulation and solution via finite topologies

DOI10.1007/978-3-540-30206-3_6MaRDI QIDQ5464765zbMATH OpenOpenAlexFDO

Authors J. M. Davoren, Thomas Moor, Rajeev Goré, Vaughan Coulthard, Anil Nerode

Publication date 19 August 2005

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

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

Mathematics Subject Classification ID

Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reformulation and approximation in model checking
• Finite approximations for model checking non-finite-state processes
• The complexity of model checking for circumscriptive formulae
• A partial approach to model checking
• On the complexity of the model checking problem
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• On the Model Checking Problem for Some Extension of CTL*
• Implication-Based Approximating Bounded Model Checking
• On the complexity of model checking and inference in minimal models (extended abstract)

This page was built for publication: On two-sided approximate model-checking: Problem formulation and solution via finite topologies

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