An Algebra for Modeling Continuous Time Systems

José E. G. de Medeiros1, George Ungureanu 2,a and Ingo Sander2,b
1University of BrasÍlia BrasÍlia, DF, Brazil
j.edil@ene.unb.br
2KTH Royal Institute of Technology Stockholm, Sweden
augeorge@kth.se
bingo@kth.se

ABSTRACT


Advancements on analog integrated design have led to new possibilities for complex systems combining both continuous and discrete time modules on a signal processing chain. However, this also increases the complexity any design flow needs to address in order to describe a synergy between the two domains, as the interactions between them should be better understood. We believe that a common language for describing continuous and discrete time computations is beneficial for such a goal and a step towards it is to gain insight and describe more fundamental building blocks. In this work we present an algebra based on the General Purpose Analog Computer, a theoretical model of computation recently updated as a continuous time equivalent of the Turing Machine.



Full Text (PDF)