Browse by author
Lookup NU author(s): Dr Jason Steggles
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
SDL is an industrial standard formal description technique for telecommunication systems. However, despite its wide spread use and industrial importance it lacks at present an adequate formal semantics integrating its static, dynamic, and real-time aspects. Timed Rewriting Logic (TRL) is a new timed variant of Rewriting Logic (RL), an algebraic formalism which allows the dynamic behaviour of systems to be axiomatised using rewrite rules. In this paper we define a new formal semantics for SDL using TRL which captures in a natural way the hierarchical structure, and the static and dynamic aspects of an SDL system. The semantics demonstrates the expressive power, versatility and automation advantages of using TRL. We consider how our new semantics can be used to simulate and reason about SDL specifications and in particular, we present an equivalence theorem that allows a wide range of TRL specifications to be implemented using RL and its associated tool support.
Author(s): Steggles LJ, Kosiuczenko P
Publication type: Article
Publication status: Published
Journal: Automated Software Engineering
Year: 2000
Volume: 7
Issue: 1
Pages: 61-90
Print publication date: 01/03/2000
ISSN (print): 0928-8910
ISSN (electronic): 1573-7535
Publisher: Springer
URL: http://dx.doi.org/10.1023/A:1008717317533
DOI: 10.1023/A:1008717317533
Altmetrics provided by Altmetric
