Location of Repository

Computing Minimal Changes of Models of Systems

By Nikos Gorogiannis, Supervisor Mark and D Ryan

Abstract

Minimal change of models of systems is a concept connected to well-known areas of the literature such as theory change and non-monotonic reasoning. However, it seems that little work has been done on bringing together the intuitions from these areas and implementing them in concrete case studies. Already existing proposals from theory change may be used for minimally changing systems in a variety of ways. However, implementations for these proposals are lacking. We address this gap by employing Binary Decision Diagrams, and construct algorithms that compute these minimal changes. The performance of these algorithms is studied theoretically. In addition, they are used in an application, fault diagnosis of combinational circuits. A case study is examined and benchmarks for the BDD algorithms are obtained. Furthermore, a specific kind of minimal change is proposed and studied, one that extends expressiveness by using modal and temporal logics instead of propositional logic. This method, minimal refinement, can be used fo

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.8987
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.eecs.qmul.ac.uk/%7E... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.