This Article 
 Bibliographic References 
 Add to: 
A Process Algebraic View of Latency-Insensitive Systems
July 2009 (vol. 58 no. 7)
pp. 931-944
Hemangee K. Kapoor, Indian Institute Of Technology, Guwahati
Latency-insensitive (LI) systems are those which can function correctly in spite of delays along its connecting wires. This delay is assumed to be a multiple of the clock period. The paper presents a single-clock process algebraic model for such systems. It gives the definitions for LI computational blocks and LI connectors. Important properties for these are shown to be satisfied. Composition of such modules can be done by the parallel composition operator of the process algebra. Conditions are given to check for liveness and deadlock freedom of LI systems. Comparison of latency equivalence between streams of events can be done using the model and this leads to a method of proving latency-equivalent modules. The paper is a step toward high-level specification and verification of such systems. The work can be extended to address more complex interconnections by modeling the underlying finite-state machines.

[1] A. Allan, D. Edenfeld, W.H. Joyner, A.B. Kahng, M. Rodgers, and Y. Zorian, “2001 Technology Roadmap for Semiconductors,” Computer, vol. 35, no. 1, pp. 42-53, Jan. 2002.
[2] L.P. Carloni and A.L. Sangiovanni-Vincentelli, “Coping with Latency in Soc Design,” IEEE Micro, pp. 24-35, Sept./Oct. 2002.
[3] J.A. Davis, “Interconnect Limits on Gigascale Integration (GSI) in the 21st Century,” Proc. IEEE, vol. 89, no. 3, pp. 305-324, Mar. 2001.
[4] C.E. Molnar, T.P. Fang, and F.U. Rosenberger, “Synthesis of Delay Insensitive Modules,” Proc. Chapel Hill Conf. Very Large Scale Integration, H. Fuchs, ed., pp. 67-86, Computer Science Press, 1985.
[5] A. Davis and S.M. Nowick, “An Introduction to Asynchronous Circuit Design,” Technical Report UUCS-97-013, Dept. of Computer Science, Univ. of Utah, Sept. 1997.
[6] C.H.v. Berkel, M.B. Josephs, and S.M. Nowick, “Scanning the Technology: Applications of Asynchronous Circuits,” Proc. IEEE, vol. 87, no. 2, pp. 223-233, Feb. 1999.
[7] S. Hauck, “Asynchronous Design Methodologies: An Overview,” Proc. IEEE, vol. 83, no. 1, pp. 69-93, Jan. 1995.
[8] L.P. Carloni, K.L. McMillan, A. Saldanha, and A.L. Sangiovanni-Vincentelli, “A Methodology for Correct-by-Construction Latency Insensitive Design,” Proc. IEEE Int'l Conf. Computer-Aided Design (ICCAD), pp. 309-315, 1999.
[9] C.A.R. Hoare, Communicating Sequential Processes. Prentice-Hall Int'l Series in Computer Science, 1985.
[10] A.W. Roscoe, The Theory and Practice of Concurrency. Prentice-Hall Int'l Series in Computer Science, 1998.
[11] S. Schneider, Concurrent and Real-Time Systems: The CSP Approach. John Wiley and Sons, 2000.
[12] L.P. Carloni, K.L. McMillan, and A.L. Sangiovanni-Vincentelli, “Theory of Latency Insensitive Design,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 20, no. 9, pp.1059-1076, Sept. 2001.
[13] S. Suhaib, D. Mathaikutty, S. Shukla, and D. Berner, “Validating Families of Latency Insensitive Protocols,” IEEE Trans. Computers, vol. 55, no. 11, pp. 1391-1401, Nov. 2006.
[14] H.K. Kapoor, “Formal Modelling and Verification of an Asynchronous DLX Pipeline,” Proc. Fourth IEEE Int'l Conf. Software Eng. Formal Methods (SEFM), pp. 118-127, 2006.
[15] C.A. Petri, “Kommunikation mit automaten,” PhD dissertation, Faculty of Math. and Physics, Technische Universitat Darmstadt, Germany, 1962.
[16] F. Commoner, A.W. Holt, S. Even, and A. Pnueli, “Marked Directed Graph,” J. Computer System Sciences, vol. 5, pp. 511-523, Oct. 1971.
[17] J. Boucaron, J.V. Millo, and R.D. Simone, “Another Glance at Relay Stations in Latency Insensitive Design,” Electronic Notes in Theoretical Computer Science, vol. 146, no. 2, pp. 41-59, 2006.
[18] C. André, “Representation and Analysis of Reactive Behaviors: A Synchronous Approach,” Computational Eng. Systems Applications, pp. 19-29, 1996.
[19] A. Bouali, “Xeve, an ESTEREL Verification Environment,” Proc. Int'l Conf. Computer Aided Verification (CAV), pp. 500-504, 1998.
[20] L.P. Carloni, “The Role of Back-Pressure in Implementing Latency Insensitive Systems,” Electronic Notes in Theoretical Computer Science, vol. 146, no. 2, pp. 61-80, 2006.
[21] F.L. Baccelli, G. Cohen, and G.J. Olsder, Synchronization and Linearity: An Algebra for Discrete Event Systems. Wiley, 1992.
[22] R. Lu and C.K. Koh, “Performance Analysis of Latency Insensitive Systems,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 3, pp. 469-483, Mar. 2006.
[23] M.R. Casu and L. Macchiarulo, “A New Approach to Latency Insensitive Design,” Proc. Design Automation Conf. (DAC), pp. 576-581, June 2004.
[24] M. Singh and M. Theobald, “Generalised Latency Insensitive Systems for GALS Architectures,” Proc. Workshop Formal Methods for Globally Asynchronous Locally Synchronous (GALS) Architecture (FMGALS-03), 2003.
[25] T. Chelcea , and S.M. Nowick, “Robust Interfaces for Mixed-Timing Systems,” IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 12, no. 8, pp. 857-873, Aug. 2004.
[26] J. Cortadella, M. Kishinevsky, and B. Grundmann, “Synthesis of Synchronous Elastic Architectures,” Proc. Design Automation Conf. (DAC), pp. 657-662, 2006.
[27] S. Krstic, J. Cortadella, M. Kishinevsky, and J. O'Leary, “Synchronous Elastic Networks,” Proc. Design Automation Conf. (DAC), 2006.
[28] D. Potop-Butucaru , and B. Caillaud, “Concurrency in Synchronous Systems,” Formal Methods in System Design, vol. 28, pp. 111-130, 2006.
[29] J.-P. Talpin , and P.L. Guernic, “An Algebraic Theory for Behavioural Modeling and Protocol Synthesis in System Design,” Formal Methods in System Design, vol. 28, pp. 131-151, 2006.
[30] S. Dasgupta, D. Potop-Butucaru, B. Caillaud, and A. Yakovlev, “Moving from Weakly Endochronous Systems to Delay Insensitive Circuits,” Electronic Notes in Theoretical Computer Science, vol. 146, pp. 81-103, 2006.
[31] R. Milner, Communication and Concurrency. Prentice-Hall Int'l Series in Computer Science, 1989.
[32] H.R. Andersen and M. Mendler, “An Asynchornous Process Algebra with Multiple Clocks,” Proc. European Symp. Programming, pp. 58-73, 1994.
[33] R. Cleaveland, G. Luttgen, and M. Mendler, “An Algebraic Theory of Multiple Clocks,” Proc. Int'l Conf. Concurrency Theory (CONCUR), pp. 166-180, 1997.
[34] B. Norton, G. Luttgen, and M. Mendler, “A Compositional Semantic Theory for Synchronous Component-Based Design,” Proc. Int'l Conf. Concurrency Theory (CONCUR), pp. 461-476, 2003.
[35] X. Nicollin , and J. Sifakis, “The Algebra of Timed Processes, ATP: Theory and Application,” Information and Computation, vol. 114, pp. 131-178, 1994.
[36] H.K. Kapoor, “Modelling Latency Insensitive Systems in CSP (Extended Abstract),” Proc. Seventh Int'l Conf. Application of Concurrency to System Design (ACSD), 2007.
[37] T. Murata, “Petri Nets: Properties, Analysis and Applications,” Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
[38] F.S.E. Ltd, “FDR Tool,” http:/, 2009.
[39] M.B. Josephs and H.K. Kapoor, “Controllable Delay Insensitive Processes,” Fundamenta Informaticae, vol. 78, no. 1, pp. 101-103, 2007.
[40] C. Li, R. Collins, S. Sonalkar, and L.P. Carloni, “Design, Implementation, and Validation of a New Class of Interface Circuits for Latency Insensitive Design,” Proc. Fifth ACM IEEE Int'l Conf. Formal Methods and Models for Codesign (MEMOCODE), pp. 13-22, 2007.

Index Terms:
Latency-insensitive systems, process algebra, communicating sequential processes, trace equivalence.
Hemangee K. Kapoor, "A Process Algebraic View of Latency-Insensitive Systems," IEEE Transactions on Computers, vol. 58, no. 7, pp. 931-944, July 2009, doi:10.1109/TC.2008.214
Usage of this product signifies your acceptance of the Terms of Use.