CONTROLLABILITY AND COOPERATIVENESS ANALYSIS FOR AUTOMATIC ABSTRACTION REFINEMENT

DOI10.1142/S0129054106004091zbMATH Open1096.68674OpenAlexW2066898843MaRDI QIDQ5484901FDOQ5484901

Authors: Freddy Y. C. Mang, Pei-Hsin Ho 

Publication date: 21 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004091

Recommendations

• Compositional abstraction refinement for control synthesis
• Synthesis of controllers for abstract and structural automata
• Lazy abstraction-based controller synthesis
• Abstraction Refinement for Attractivity Controllers Using Quantitative Synthesis
• Compositional Construction of Approximate Abstractions of Interconnected Control Systems
• scientific article; zbMATH DE number 1903350
• Counterexample guided abstraction refinement for stability analysis
• Non-monotonic refinement of control abstraction for concurrent programs
• scientific article; zbMATH DE number 2090155

zbMATH Keywords

controllabilityabstraction refinementformal verificationcooperativeness

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Model checking of safety properties
• Title not available (Why is that?)

This page was built for publication: CONTROLLABILITY AND COOPERATIVENESS ANALYSIS FOR AUTOMATIC ABSTRACTION REFINEMENT

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