Maximum Time Separation of Events in Cyclic Systems with Linear and Latest Timing Constraints

  • Fen Jin
  • Henrik Hulgaard
  • Eduard Cerny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1522)


The determination of the maximum time separations of events is important in the design, synthesis, and verification of digital systems, especially in interface timing verification. Many researchers have explored solutions to the problem with various restrictions: a) on the type of constraints, and b) on whether the events in the specification are allowed to occur repeatedly. When the events can occur only once, the problem is well solved. There are fewer concrete results for systems where the events can occur repeatedly. We extend the work by Hulgaard et al. for computing the maximum separation of events in cyclic constraint graphs with latest constraints to constraint graphs with both linear and latest constraints.


Short Path Occurrence Time Local Constraint Cyclic System Maximum Separation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, New York, 1992.Google Scholar
  2. 2.
    S. M. Burns. Performance Analysis and Optimization of Asynchronous Circuits. Ph.D. thesis, California Institute of Technology, 1991. CS-TR-91-1.Google Scholar
  3. 3.
    E. Cerny and K. Khordoc. Interface specifications with conjunctive timing constraints: Realisability and compatibility. In 2nd AMAST Workshop on Real-Time Systems, Bordeaux, June 1995.Google Scholar
  4. 4.
    E. Cerny, Y. Wang, and M. Aboulhamid. Scheduling and interface controller synthesis under real-time constraints. In 4th AMAST Workshop on Real-Time Systems, Bordeaux, June 1997.Google Scholar
  5. 5.
    P. Girodias. Interface Timing Verification Using Constrain Logic Programming. PhD thesis, University of Montreal, 1997.Google Scholar
  6. 6.
    P. Girodias and E. Cerny. Interface timing verification with delay correlation using constrain logic programming. In Proceedings of the European Design & Test Conference, Paris, March 1997.Google Scholar
  7. 7.
    P. Girodias, E. Cerny, and W. J. Older. Solving linear, min, and max constraint systems using CLP based on relational interval arithmetic. Journal of Theoretical Computer Science, 173:253–281, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    H. Hulgaard and S. M. Burns. Bounded delay timing analysis of a class of CSP program. Formal Methods in System Design, 11(3):265–294, 1997.CrossRefGoogle Scholar
  9. 9.
    H. Hulgaard, S. M. Burns, T. Amon, and G. Borriello. An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Transactions on Computers, 44(11):1306–1317, November 1995.Google Scholar
  10. 10.
    F. Jin and E. Cerny. Time separation of events in cyclic systems with linear and latest timing constraints. Technical report, University of Montreal, 1998.Google Scholar
  11. 11.
    K. Khordoc and E. Cerny. Semantics and verification of action diagrams with linear timing constraints. ACM Transactions on Design Automation of Electronic Systems, 3(1), 1998.Google Scholar
  12. 12.
    E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.zbMATHGoogle Scholar
  13. 13.
    K. McMillan and D. L. Dill. Algorithms for interface timing verification. In IEEE International Conference on Computer Design, pages 48–51, 1992.Google Scholar
  14. 14.
    C. J. Myers and T. H.-Y. Meng. Synthesis of timed asynchronous circuits. IEEE Transactions on VLSI Systems, 1(2):106–119, 1993.CrossRefGoogle Scholar
  15. 15.
    P. Vanbekbergen, G. Goossens, and H. D. Man. Specification and analysis of timing constraints in signal transition graphs. In European Design Automation Conference, pages 302–306, March 1992.Google Scholar
  16. 16.
    E. A. Walkup and G. Borriello. Interface timing verification with applications to synthesis. In Proceedings of the Designs Automation Conference, 1994.Google Scholar
  17. 17.
    T. Y. Yen, A. Ishii, A. Casavant, and W. Wolf. Efficient algorithms for interface timing verification. In Proceedings of the European Design Automation Conference, pages 34–39, September 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Fen Jin
    • 1
  • Henrik Hulgaard
    • 2
  • Eduard Cerny
    • 1
  1. 1.LASSO, Départment d’Informatique et de Recherche OpérationelleUniversité de MontréalUSA
  2. 2.Department of Information TechnologyTechnical University of DenmarkUSA

Personalised recommendations