| dc.contributor.author | Bournez, Olivier | |
| dc.contributor.author | Graça, Daniel | |
| dc.contributor.author | Hainry, Emmanuel | |
| dc.date.accessioned | 2012-04-17T09:25:19Z | |
| dc.date.available | 2012-04-17T09:25:19Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to in nitesimal perturbations. Whereas the study in [1] was done only for not-so-natural systems from a classical mathematical point of view (discontinuous di erential equation systems, discontinuous piecewise a ne maps, or perturbed Turing machines), we prove that the results presented there can be generalized to Lipschitz and computable dynamical systems. In other words, we prove that the perturbed reachability problem (i.e. the reachability problem for systems which are subjected to in nitesimal perturbations) is co-recursively enumerable for this kind of systems. Using this result we show that if robustness to in nitesimal perturbations is also required, the reachability problem becomes decidable. This result can be interpreted in the following manner: undecidability of veri cation doesn't hold for Lipschitz, computable and robust systems. We also show that the perturbed reachability problem is co-r.e. complete even for C1-systems. | por |
| dc.identifier.other | AUT: DGR01772; | |
| dc.identifier.uri | http://hdl.handle.net/10400.1/1035 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | P. Hlinený and A. Kucera | por |
| dc.relation.ispartofseries | Lecture Notes in Computer Science ARCoSS (Advanced Research in Computing and Software Science);6281 | |
| dc.relation.publisherversion | http://www.springerlink.com/content/pux2120952u4207t/ | por |
| dc.subject | Veri cation | por |
| dc.subject | Analog computations | por |
| dc.subject | Computable analysis | por |
| dc.subject | Model-checking | por |
| dc.title | Robust computations with dynamical systems | por |
| dc.type | book part | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 208 | por |
| oaire.citation.startPage | 198 | por |
| oaire.citation.title | Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) | por |
| person.familyName | Graça | |
| person.givenName | Daniel | |
| person.identifier.ciencia-id | 2D11-56DE-3F11 | |
| person.identifier.orcid | 0000-0002-0330-833X | |
| person.identifier.rid | D-2335-2011 | |
| person.identifier.scopus-author-id | 8882791800 | |
| rcaap.rights | openAccess | por |
| rcaap.type | bookPart | por |
| relation.isAuthorOfPublication | ba0c1461-5d2d-4f06-b648-df4a1a505bdf | |
| relation.isAuthorOfPublication.latestForDiscovery | ba0c1461-5d2d-4f06-b648-df4a1a505bdf |
