Model Checking on Trees with Path Equivalences

DOI10.1007/978-3-540-71209-1_51zbMath1186.68273OpenAlexW2128610788MaRDI QIDQ5758138

Swarat Chaudhuri, Pavol Černý, Rajeev Alur

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_51

Mathematics Subject Classification ID

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

Related Items

Model Checking Information Flow in Reactive Systems ⋮ Detection of hubs in complex networks by the Laplacian matrix ⋮ An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking ⋮ Recent developments in high dimensional covariance estimation and its related issues, a review ⋮ Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Model checking the observational determinism security property using PROMELA and SPIN ⋮ A GENERAL NOTION OF UNIFORM STRATEGIES ⋮ Collaborative planning with confidentiality ⋮ Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions ⋮ Unnamed Item ⋮ Dynamic Observers for the Synthesis of Opaque Systems

Uses Software

• NuSMV

This page was built for publication: Model Checking on Trees with Path Equivalences