2026-06-08T23:32:20Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/606612024-10-08T12:55:37Zcom_20.500.14352_14col_20.500.14352_21

00925njm 22002777a 4500 dc Llana Díaz, Luis Fernando author Frutos Escrig, David De author 1997 In this paper we present a denotational semantics for a timed process algebra, which is fully abstract with respect to the must testing semantics previously developed [Lla96,LdFN96]. The domain of semantic processes is made up of consistent sets of barbs, which generalize the notion of acceptance sets, in such a way that the actions that are offered but not taken in each state are also recorded. the main difficulty when defining this denotational semantics has been that the natural ordering between semantic processes cannot be proved to be complete. So an alternative stronger complete ordering has to be considered, which is proved to be consistent with the original one, in the sense that lubs of chains with respect to the new ordering are also lubs with respect to the original one. Llana Díaz, L. F. & Frutos Escrig, D. «Denotational semantics for timed testing». Transformation-Based Reactive Systems Development, editado por Miquel Bertran y Teodor Rus, vol. 1231, Springer Berlin Heidelberg, 1997, pp. 368-82. DOI.org (Crossref), https://doi.org/10.1007/3-540-63010-4_25. 978-3-540-63010-4 10.1007/3-540-63010-4_25 https://hdl.handle.net/20.500.14352/60661 https//doi.org/10.1007/3-540-63010-4_25 http://link.springer.com/content/pdf/10.1007%2F3-540-63010-4_25 Denotational semantics for timed testing