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.

Timed-Automata Based Schedulability Analysis for Distributed Firm Real-Time Systems: a Case Study / Le, Thi Thieu Hoa; Palopoli, Luigi; Passerone, Roberto; Y., Ramadian. - In: INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER. - ISSN 1433-2779. - STAMPA. - 15:3(2013), pp. 211-228. [10.1007/s10009-012-0245-y]

Timed-Automata Based Schedulability Analysis for Distributed Firm Real-Time Systems: a Case Study

Le, Thi Thieu Hoa;Palopoli, Luigi;Passerone, Roberto;
2013-01-01

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.
2013
3
Le, Thi Thieu Hoa; Palopoli, Luigi; Passerone, Roberto; Y., Ramadian
Timed-Automata Based Schedulability Analysis for Distributed Firm Real-Time Systems: a Case Study / Le, Thi Thieu Hoa; Palopoli, Luigi; Passerone, Roberto; Y., Ramadian. - In: INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER. - ISSN 1433-2779. - STAMPA. - 15:3(2013), pp. 211-228. [10.1007/s10009-012-0245-y]
File in questo prodotto:
File Dimensione Formato  
LePalopoliPasseroneRamadian13STTT.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.04 MB
Formato Adobe PDF
1.04 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/35416
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? ND
social impact