Blind spots of qualitative simulators
| dc.contributor | Graduate Program in Computer Engineering. | |
| dc.contributor.advisor | Say, Ahmet Celal Cem. | |
| dc.contributor.author | Taşdemir, Nuri. | |
| dc.date.accessioned | 2023-03-16T10:06:39Z | |
| dc.date.available | 2023-03-16T10:06:39Z | |
| dc.date.issued | 2007. | |
| dc.description.abstract | Qualitative simulators are important tools for analyzing the possible behaviors of a dynamical system. The technique of qualitative simulation has some theoretical limitations. For some input system models, a qualitative simulator either predicts spurious (impossible) behaviors or does not predict some possible behaviors. It has been shown that a “perfect” qualitative simulator cannot be built, because there are some spurious behaviors which cannot be proven to be spurious. This thesis questions the possibility of building a qualitative simulator which can detect and eliminate all spurious behaviors which can be proven to be so. We find the answer to be negative. For each qualitative simulator which possesses some reasonable properties, there is an efficiently constructible, provably inconsistent input which cannot be rejected by the simulator in question. In addition, it is shown that there exist spurious behaviors which require exponential time to detect. | |
| dc.format.extent | 30cm. | |
| dc.format.pages | xi, 34 leaves; | |
| dc.identifier.other | CMPE 2007 T37 | |
| dc.identifier.uri | https://digitalarchive.library.bogazici.edu.tr/handle/123456789/12521 | |
| dc.publisher | Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2007. | |
| dc.relation | Includes appendices. | |
| dc.relation | Includes appendices. | |
| dc.subject.lcsh | Optic disc. | |
| dc.subject.lcsh | Reasoning. | |
| dc.subject.lcsh | Recursion theory. | |
| dc.subject.lcsh | Gödel's theorem. | |
| dc.title | Blind spots of qualitative simulators |
Files
Original bundle
1 - 1 of 1