@inbook{0fabe2418ec24b30919d2757299afa40,
title = "Techniques for executing and reasoning about specification diagrams",
abstract = "Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate specification of system behaviors at various levels of abstraction, ranging from high-level specifications to concrete diagrams with low-level implementation details. We investigate the theory of may testing equivalence [15] on SDs, which is a notion of process equivalence that is useful for relating diagrams at different levels of abstraction. We present a semantic characterization of the may equivalence on SDs which provides a powerful technique to relate abstract specifications and refined implementations. We also describe our prototypical implementation of SDs and of a procedure that exploits the characterization of may testing to establish equivalences between finitary diagrams (without recursion).",
keywords = "Graphical specification languages, May testing, Rewriting logic, TT-calculus, Trace equivalence",
author = "Prasanna Thati and Carolyn Talcott and Gul Agha",
year = "2004",
doi = "10.1007/978-3-540-27815-3\_39",
language = "English (US)",
isbn = "3540223819",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "521--536",
editor = "Charles Rattray and Savitri Maharaj and Carron Shankland",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}