Abstract
A way of achieving concurrent behavior in asynchronous sequential networks consists in dedicating a component of the state set, called phase component, to the task of timing the evolution of another component of the state set, called data component. We discuss the problem of recovering the correct timing relationship between data items from the information contained in the phase component.
Logic of Computers Group, 2080 Frieze Bldg., University of Michigan, Ann Arbor, MI 48104, USA. Assistance in the preparation of this paper was received through National Science Foundation Grant No. MCS76-04297.
Preview
Unable to display preview. Download preview PDF.
References
Toffoli, Tommaso, "Cellular Automata Mechanics" (Ph.D. Thesis), Tech. Rep. No. 208, Logic of Computers Group, University of Michigan, Dept. of Computer and Communication Sciences, 1977.
Toffoli, Tommaso, "A Canonical Solution of the Synchronization Problem" (submitted for publication), 1978. (Most of this material is presented informally in [1].)
Lipton, R.J., Miller, R.E., and Snyder, L., "Synchronization and Computing Capabilities of Linear Asynchronous Structures," IBM Tech. Rep. No. RC-5857, 1976.
Berge, Claude, Graphs and Hypergraphs, North-Holland, 1973.
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toffoli, T. (1978). Integration of the phase-difference relations in asynchronous sequential networks. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_34
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive