CONTROLLABILITY AND COOPERATIVENESS ANALYSIS FOR AUTOMATIC ABSTRACTION REFINEMENT

DOI10.1142/S0129054106004091MaRDI QIDQ5484901zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

controllabilityabstraction refinementformal verificationcooperativeness

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

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

Cites work

• scientific article; zbMATH DE number 734956 (Why is no real title available?)
• Model checking of safety properties

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)