Abstract
Many real problems can be treated as Constraint Satisfaction Problems (CSPs), a type of problem for which efficient tools have been developed. Computing the maximum timing separations between the events of a timing specification falls into this category. CLP (BNR) is a constraint logic programming language which seems well suited to the problem, allowing to draw from the advantages of both CSPs and Logic Programming. Consistency techniques used for solving general CSPs usually produce approximate answers (partial consistency) and the resolution engine for CLP (BNR) behaves in a similar fashion. However, for some specific timing specifications, we show that global consistency can be achieved using CLP (BNR). The timing specifications we consider are systems of strictly linear constraints, systems of either max-only or min-only constraints, and systems where linear and either max or min constraints intermix.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. McMillan and D. Dill, “Algorithms for Interface Timing Verification”, Proceedings of the IEEE International Conference on Computer Design, 1992.
T. Amon, H. Hulgaard, G. Borriello and S. Burns, “Timing Analysis of Concurrent Systems”, Proceedings of the Design Automation Conference, 1993.
J.A. Brozowski, T. Gahlinger and F. Mavaddat, “Consistency and Satisfiability of Waveform Timing Specifications”, Networks, Vol. 21, p. 91–107, 1991.
T.-Y. Yen, A. Ishii, A. Casavant and W. Wolf, “Efficient Algorithms for Interface Timing Verification”, Proceedings of the Design Automation Conference, 1994.
T. Amon and G. Borriello, “An Approach to Symbolic Timing Verification”, 29th ACM/IEEE Design Automation Conference, 1992.
W. Older, and A. Vellino, “Constraint Arithmetic on Real Intervals”, Constraints Logic Programming: Selected Research, 1993.
Vanbekbergen, P. G. Goossens and H. De Man, “Specification and Analysis of Timing Constraints in Signa Transitions Graphs”, Proceedings of the European Conference on Design Automation, 1992.
E.A. Walkup, and G. Borriello, “Interface Timing Verification with Applications to Synthesis”, Proceedings of the Design Automation Conference, 1994.
P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, 1989.
O. Lhomme, “Consistency techniques for numeric CSPs”, Proceedings of the 13th IJCAI, 1993.
R.E. Moore, Methods and Applications of Interval Analysis, SIAM, 1979.
T. Gahlinger. “Coherence and Satisfiability of Waveform Timing Specifications”. Research Report CS-90-11. University of Waterloo. 1990. Ph. D. thesis.
W. Leler, Constraint Programming Languages: Their Specification and Generation, Addison-Wesley, 1988.
K. Khordoc, M. Dufresne, E. Cerny, P.-A. Babkine and A. Silburt, “Integrating Behaviour and Timing in Executable Specifications”, Proceedings of the IFIP Conference on HDL and their applications, p. 385–402, 1993.
H. Vandecasteele, and D. De Schreye, “Implementing a Finite-domain CLP-language on Top of Prolog: a Transformation Approach, Lecture Notes in Artificial Intelligence 822, Proceedings of the 5th International Conference Logic Programming and Automated Reasoning, p. 84–98, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girodias, P., Cerny, E., Older, W.J. (1995). Solving linear, min and max constraint systems using CLP based on relational interval arithmetic. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-60299-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60299-6
Online ISBN: 978-3-540-44788-7
eBook Packages: Springer Book Archive