Skip to main content

Advertisement

SpringerLink
Log in

Min–Max Inequalities and the Timing Verification Problem with Max and Linear Constraints

  • Original Article
  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

In this paper the timing verification problem with max and linear constraints is formulated in min–max inequalities. An algorithm MMIsolve, based on the UBCsolve algorithm of Walkup, is proposed for solving min-max inequalities and for efficiently finding the maximum time separations between events. A concept of structural finite separation is introduced, and it is found that structural finite separation is a sufficient, but not necessary condition for finite separation. The two conditions are equivalent when the parameters are only allowed to take nonnegative values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baccelli, F., Cohen, G., and Gaujal, B. 1991. Evolution equations of timed Petri nets. In Proc. 30th IEEE Conf. Decis. Control, Brighton, England, pp. 1139–1144.

  • Baccelli, F., Cohen, G., Olsder, G. J., and Quadrat, J.-P. 1992. Synchronization and Linearity. New York: Wiley.

    MATH  Google Scholar 

  • Borriello, G. 1988. A new interface specification methodology and its application to transducer analysis. Ph.D. Thesis, Berkeley: University of California.

  • Brzozowski, J. A., Gahlinger, T., and Mavaddat, F. 1991. Consistency and satisfiablity of waveform timing specifications. Networks 1(1): 91–107.

    MathSciNet  Google Scholar 

  • Cheng, Y., and Zheng, D.-Z. 2004. A cycle time computing algorithm and its application in the structural analysis of min–max systems. Discret. Event Dyn. Syst.: Theory Appl. 14(1): 5–30.

    Article  MATH  MathSciNet  Google Scholar 

  • Cuninghame-Green, R. A. 1979. Minimax Algebra, volume 166 of Lecture Notes in Economics and Mathematical Systems. Berlin, Germany: Springer-Verlag.

    Google Scholar 

  • De Schutter, B., and De Moor, B. 1996. A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra. Discret. Event Dyn. Syst.: Theory Appl. 6(2): 115–138.

    MATH  Google Scholar 

  • De Schutter, B., Heemels, W. P. M. H., and Bemporad, A. 2002. On the equivalence of linear complemantarity problems. Oper. Res. Lett. 30(4): 211–222.

    Article  MATH  MathSciNet  Google Scholar 

  • Gahlinger, T. 1990. Coherence and satisfiablity of waveform timing specifications, Ph.D. Thesis, University of Waterloo.

  • Gaubert, S., and Gunawardena, J. 1998. A non-linear hierarchy for discrete event dynamical systems. In Proc. 4th Workshop Discret. Event Syst., Cagliari, Italy.

  • Gunawardena, J. 1994a. Min–max functions. Discret. Event Dyn. Syst.: Theory Appl. 4: 377–406.

    Article  MATH  Google Scholar 

  • Gunawardena, J. 1994b. Cycle times and fixed points of min–max functions. In Proc. 11th International Conference on Analysis and Optimization of Systems, volume 199 of LNCIS, Springer, pp. 266–272.

  • Hulgaard, H., Burns, S. M., Amon, T., and Borriello, G. 1995. An algorithm for exact bounds on time separation of events in concurrent systems. IEEE. Trans. Comput. 44: 1306–1317.

    Article  MATH  Google Scholar 

  • Kohlberg, E. 1980. Invariant half-lines of nonexpansive piecewise-linear transformations. Math. Oper. Res. 5(3): 366–372.

    Article  MATH  MathSciNet  Google Scholar 

  • McMillan, K. L., and Dill, D. L. 1992. Algorithms for interface timing verification. In Proc. Int. Conf. Comput. Des.: VLSI Computers and Processors, pp. 48–51.

  • Olsder, G. J. 1991. Eigenvalues of dynamic max–min systems. Discret. Event Dyn. Syst.: Theory Appl. 1: 177–207.

    MATH  Google Scholar 

  • Olsder, G. J., and Perennes, S. 1997. Iteration of (Min,Max,+) functions. Draft. Available: http://citeseer.nj.nec.com/310205.html.

  • Walkup, E. A. 1995. Optimization of linear max-plus systems with application to timing analysis, Ph.D. Thesis, Department of Computer Science, University of Washington.

  • Walkup, E. A., and Borriello, G. 1994. Interface timing verification with combined max and linear constraints. Technical Report 94-03-04, Department of Computer Science, University of Washington.

  • Yen, T., Ishii, A., Casavant, A., and Wolf, W. 1998. Efficient algorithms for interface timing verification. Form. Methods Syst. Des. 12(3): 241–265.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, 100044, China

    Yiping Cheng

  2. Department of Automation, Tsinghua University, Beijing, 100044, China

    Da-Zhong Zheng

Authors
  1. Yiping Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Da-Zhong Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yiping Cheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, Y., Zheng, DZ. Min–Max Inequalities and the Timing Verification Problem with Max and Linear Constraints. Discrete Event Dyn Syst 15, 119–143 (2005). https://doi.org/10.1007/s10626-004-6209-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-004-6209-y

Keywords

Search

Navigation