Abstract
We propose a compositional proof system for checking real-time properties of a dicrete timed process language TSP with minimal and maximal delays associated to actions. In order to capture the quantitative aspect of time we consider a discrete extension of μ-calculus with freeze quantification over clocks and clock constraints. The language TSP is parametric in the set of basic actions and it is characterized by an operator of process refinement, which permits to suitably model a discrete timed version of statecharts. The proof system is proved to be sound in general and complete for the class of regular finite state processes. It is indeed complete for processes corresponding to statecharts.KeywordsProof SystemParallel CompositionMaximal DelayExtended TypeClosed ProcessThese 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.
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.
