Abstract
Duration Calculus (DC), an extension of interval temporal logic, has been shown very powerful and suitable for specifying multimedia protocols. Generally speaking, it is impossible to verify the DC specifications using model-checking because of DC's undecidability. H. Dierks (1999) presented an approach to solving the problem. The main contribution of this paper is improving H. Dierks's algorithm so that it can be used to transform the DC specification of multimedia protocols to the input of the model checker. The basic idea behind this work is that we use general DC to specify multimedia protocols, and the improved H. Dierks' algorithm to transform them to PLC-Automata, further to Timed Automata. Using model-checkers developed for TA, we can verify the correctness of protocols. We shall demonstrate it by Adaptive LSP. For convenience, we use more general forms of DC Implementables, but they can be reduced to the four standard forms given by H. Dierks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
