A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
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.doi:10.1007/978-3-540-78163-9_9 dblp:conf/vmcai/CimattiRST08 fatcat:me3qeclrmrc73k3wsg4iu2awla