Abstract
The growing level of complexity of modern embedded systems, which are increasingly distributed and heterogeneous, calls for new design approaches able to reconcile mathematical rigour with flexibility, user-friendliness and scalability. In the last few years, Timed Automata (TA) have emerged as a very promising formalism for the availability of very effective verification tools. However, their adoption in the industrial community is still slow. The reluctance of industrial practitioners is partly motivated by persistent concerns on the ease of use of this formalism, on the scalability of the verification process and on the quality of the feedback that the designer receives. In this paper, we discuss these issues by showing the application of the TA formalism on a case study of industrial complexity. We expose the generality of the approach, the efficiency of state of the art tools, but also the limitations in the semantics and in dealing with free design parameters.
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 on Software Tools for Technology Transfer
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.
