Denotational semantics for timed testing



Downloads per month over past year

Llana Díaz, Luis Fernando and Frutos Escrig, David de (1997) Denotational semantics for timed testing. In Transformation-Based Reactive Systems Development : 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software, ARTS'97 Palma, Mallorca, Spain, May 21–23, 1997 Proceedings. Lecture notes in computer science (1231). Springer, pp. 368-382. ISBN 978-3-540-63010-4

[thumbnail of Frutos32springer.pdf]

Official URL:


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.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20771
Deposited On:11 Apr 2013 09:38
Last Modified:02 Sep 2020 09:46

Origin of downloads

Repository Staff Only: item control page