Formal testing of systems presenting soft and hard deadlines
We present a formal framework to specify and test systems presenting both soft and hard deadlines. While hard deadlines must be always met on time, soft deadlines can be sometimes met in a different time, usually higher, from the specified one. It is this characteristic (to formally define sometimes...
| Autores: | , , |
|---|---|
| Tipo de documento: | capítulo de livro |
| Data de publicação: | 2007 |
| País: | España |
| Recursos: | Universidad Complutense de Madrid (UCM) |
| Repositório: | Docta Complutense |
| Idioma: | inglês |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/53128 |
| Acesso em linha: | https://hdl.handle.net/20.500.14352/53128 |
| Access Level: | Acceso aberto |
| Palavra-chave: | 519.8 Probabilistic processes Timed systems Process algebra Automata EFSMS Computer Science Theory & Methods Investigación operativa (Matemáticas) 1207 Investigación Operativa |
| Resumo: | We present a formal framework to specify and test systems presenting both soft and hard deadlines. While hard deadlines must be always met on time, soft deadlines can be sometimes met in a different time, usually higher, from the specified one. It is this characteristic (to formally define sometimes) what produces several reasonable alternatives to define appropriate implementation relations, that is, relations to decide wether an implementation is correct with respect to a specification. In addition to introduce these relations, we define a testing framework to test implementations. |
|---|