Abstract
A sub-class of timed automata known as timed automata with deadlines was presented. Parallel composition and other operators were defined according to 'orthogonality' principal, for timed process algebras and hybrid automata. The compositional description methods that are based on 'flexible' composition rules that relax urgency constraints to preserve time reactivity was also studied.
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.
