Abstract
The verification of dynamic real-time systems, such as ad-hoc networks and ambient systems needs formal approaches and frameworks enabling tool construction. In this paper, the decidability question is addressed on a class of timed automata, the dynamic timed automata with relative time rates model rd-TA. We introduce rd-TA as a simple extension of standard timed automata in which any process may spawn new processes. In this model, the distributed timed systems are formed by a set of dynamic timed automata. Each automaton is characterised by a set of local clocks that evolve at different but relative rate of the clocks of the other components. The main contribution is the consideration of slope parameter which is the ratio of clock rates. This parameter helps us to explore the semantics based on region abstraction for decidability assessment and proof.
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 callMore From: International Journal of Communication Networks and Distributed Systems
Disclaimer: 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.
