Abstract
Realizability - checking whether a specification can be implemented by an open system - is a fundamental step in the design flow. However, if the specification turns out not to be realizable, there is no method to pinpoint the causes for unrealizability. In this paper, we address the open problem of providing diagnostic information for realizability: we formally define the notion of (minimal) explanation of (un)realizability, we propose algorithms to compute such explanations, and provide a preliminary experimental evaluation. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Cimatti, A., Roveri, M., Schuppan, V., & Tchaltsev, A. (2008). Diagnostic information for realizability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4905 LNCS, pp. 52–67). https://doi.org/10.1007/978-3-540-78163-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
