Files

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.

Details

Actions

Preview