Towards an Axiomatization of Simple Analog Algorithms

Olivier Bournez 1 Nachum Dershowitz 2 Evgenia Falkovich 2
1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 TAU-CS - School of Computer Science
Abstract : We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
https://hal-polytechnique.archives-ouvertes.fr/hal-00760736
Contributor : Olivier Bournez <>
Submitted on : Tuesday, December 4, 2012 - 12:44:53 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Tuesday, March 5, 2013 - 3:52:08 AM

File

tamc-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00760736, version 1

Collections

LIX | PARISTECH | X | X-LIX | X-DEP-INFO

Citation

Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich. Towards an Axiomatization of Simple Analog Algorithms. Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Date-Added = 2012-05-04 20:32:53 +0000, Date-Modified = 2012-05-04 20:35:01 +0000, 2012, China. pp.525-536. ⟨hal-00760736⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

225

Files downloads

340

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD