Logo do repositório
 
Publicação

Robust computations with dynamical systems

dc.contributor.authorBournez, Olivier
dc.contributor.authorGraça, Daniel
dc.contributor.authorHainry, Emmanuel
dc.date.accessioned2012-04-17T09:25:19Z
dc.date.available2012-04-17T09:25:19Z
dc.date.issued2010
dc.description.abstractIn 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.otherAUT: DGR01772;
dc.identifier.urihttp://hdl.handle.net/10400.1/1035
dc.language.isoengpor
dc.peerreviewedyespor
dc.publisherP. Hlinený and A. Kucerapor
dc.relation.ispartofseriesLecture Notes in Computer Science ARCoSS (Advanced Research in Computing and Software Science);6281
dc.relation.publisherversionhttp://www.springerlink.com/content/pux2120952u4207t/por
dc.subjectVeri cationpor
dc.subjectAnalog computationspor
dc.subjectComputable analysispor
dc.subjectModel-checkingpor
dc.titleRobust computations with dynamical systemspor
dc.typebook part
dspace.entity.typePublication
oaire.citation.endPage208por
oaire.citation.startPage198por
oaire.citation.titleProceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010)por
person.familyNameGraça
person.givenNameDaniel
person.identifier.ciencia-id2D11-56DE-3F11
person.identifier.orcid0000-0002-0330-833X
person.identifier.ridD-2335-2011
person.identifier.scopus-author-id8882791800
rcaap.rightsopenAccesspor
rcaap.typebookPartpor
relation.isAuthorOfPublicationba0c1461-5d2d-4f06-b648-df4a1a505bdf
relation.isAuthorOfPublication.latestForDiscoveryba0c1461-5d2d-4f06-b648-df4a1a505bdf

Ficheiros

Principais
A mostrar 1 - 1 de 1
A carregar...
Miniatura
Nome:
10-BGH-robust.pdf
Tamanho:
193.86 KB
Formato:
Adobe Portable Document Format
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: